NotesFAQContact Us
Collection
Advanced
Search Tips
Showing 1 to 15 of 20 results Save | Export
Peer reviewed Peer reviewed
Direct linkDirect link
Shu, Tian; Luo, Guanzhong; Luo, Zhaosheng; Yu, Xiaofeng; Guo, Xiaojun; Li, Yujun – Journal of Educational and Behavioral Statistics, 2023
Cognitive diagnosis models (CDMs) are the statistical framework for cognitive diagnostic assessment in education and psychology. They generally assume that subjects' latent attributes are dichotomous--mastery or nonmastery, which seems quite deterministic. As an alternative to dichotomous attribute mastery, attention is drawn to the use of a…
Descriptors: Cognitive Measurement, Models, Diagnostic Tests, Accuracy
Peer reviewed Peer reviewed
Hoenkamp, Eduard – Journal of the American Society for Information Science and Technology, 2003
Discusses latent semantic indexing (LSI) that would allow search engines to reduce the dimension of the document space by mapping it into a space spanned by conceptual indices. Topics include vector space models; singular value decomposition (SVD); unitary operators; the Haar transform; and new algorithms. (Author/LRW)
Descriptors: Algorithms, Information Retrieval, Mathematical Formulas, Models
Peer reviewed Peer reviewed
Chen, Oscal T.-C.; And Others – Information Processing and Management, 1992
Describes a modified frequency-sensitive self-organization (FSO) algorithm for image data compression and the associated VLSI architecture. Topics discussed include vector quantization; VLSI neural processor architecture; detailed circuit implementation; and a neural network vector quantization prototype chip. Examples of images using the FSO…
Descriptors: Algorithms, Coding, Information Processing, Mathematical Formulas
Peer reviewed Peer reviewed
Dominich, Sandor – Journal of Documentation, 1994
Discussion of information retrieval focuses on an Interaction Information Retrieval model in which documents are interconnected; queries and documents are treated in the same way; and retrieval is the result of the interconnection between query and documents. A theoretical mathematical formulation of this type of retrieval is given. (Contains 31…
Descriptors: Algorithms, Documentation, Information Retrieval, Interaction
Peer reviewed Peer reviewed
Howard, Paul G.; Vitter, Jeffrey Scott – Information Processing and Management, 1992
Analyzes the amount of compression possible when arithmetic coding is used for text compression in conjunction with various input models. Algorithms are analyzed; modeling effects are considered; scaling is discussed; higher order models are examined, including prediction by partial matching; and coding effects are described. (34 references) (LRW)
Descriptors: Algorithms, Coding, Computation, Information Processing
Peer reviewed Peer reviewed
Mather, Laura A. – Journal of the American Society for Information Science, 2000
Discussion of models for information retrieval focuses on an application of linear algebra to text clustering, namely, a metric for measuring cluster quality based on the theory that cluster quality is proportional to the number of terms that are disjoint across the clusters. Explains term-document matrices and clustering algorithms. (Author/LRW)
Descriptors: Algorithms, Cluster Analysis, Information Retrieval, Mathematical Formulas
Peer reviewed Peer reviewed
Bartell, Brian T.; And Others – Journal of the American Society for Information Science, 1995
Discussion of the failure of individual keywords to identify conceptual content of documents in retrieval systems highlights Metric Similarity Modeling, a method for creating vector space representation of documents based on modeling target interdocument similarity values. Semantic relatedness, latent semantic indexing, an indexing and retrieval…
Descriptors: Algorithms, Databases, Documentation, Indexing
Peer reviewed Peer reviewed
Miyamoto, Sadaaki – Information Processing & Management, 2003
Proposes a fuzzy multiset model for information clustering with application to information retrieval on the World Wide Web. Highlights include search engines; term clustering; document clustering; algorithms for calculating cluster centers; theoretical properties concerning clustering algorithms; and examples to show how the algorithms work.…
Descriptors: Algorithms, Information Retrieval, Mathematical Formulas, Models
Peer reviewed Peer reviewed
Boughanem, M.; Chrisment, C.; Soule-Dupuy, C. – Information Processing & Management, 1999
Presents a relevance-feedback strategy that improves the effectiveness of information-retrieval systems based on back-propagation of the relevance of retrieved documents using an algorithm developed in a neural approach. Describes a neural information-retrieval model and reports results obtained with the algorithm in three different environments.…
Descriptors: Algorithms, Information Retrieval, Mathematical Formulas, Models
Peer reviewed Peer reviewed
Shapira, Bracha; And Others – Online & CD-ROM Review, 1996
Discussion of hypertext browsing proposes a filtering algorithm which restricts the amount of information made available to the user by calculating the set of most relevant hypertext nodes for the user, utilizing the user profile and data clustering technique. An example is provided of an optimal cluster of relevant data items. (Author/LRW)
Descriptors: Algorithms, Hypermedia, Information Retrieval, Mathematical Formulas
Peer reviewed Peer reviewed
Bodoff, David; Wu, Bin; Wong, K. Y. Michael – Journal of the American Society for Information Science and Technology, 2003
Presents a preliminary empirical test of a maximum likelihood approach to using relevance data for training information retrieval parameters. Discusses similarities to language models; the unification of document-oriented and query-oriented views; tests on data sets; algorithms and scalability; and the effectiveness of maximum likelihood…
Descriptors: Algorithms, Information Retrieval, Mathematical Formulas, Maximum Likelihood Statistics
Peer reviewed Peer reviewed
Danilowicz, Czeslaw – Information Processing and Management, 1994
Discusses end-user searching in Boolean information retrieval systems considers the role of search intermediaries and proposes a model of user preferences that incorporates a user's profile. Highlights include document representation; information queries; document output ranking; calculating user profiles; and selecting documents for a local…
Descriptors: Algorithms, Comparative Analysis, Databases, Information Retrieval
Peer reviewed Peer reviewed
Vassilakopoulos, Michael; Manolopoulos, Yannis – Information Systems, 1995
Presents an improved inverted region quadtree variation called Dynamic Inverted Quadtree that is able to support and index a pictorial database. Pattern-searching algorithms are described, and the space needs of Fully Inverted and Dynamic Inverted Quadtrees are analytically compared based on a model of image randomness expressed as a branching…
Descriptors: Algorithms, Branching, Comparative Analysis, Computer System Design
Peer reviewed Peer reviewed
Goosen, Kenneth R.; Kusel, Jimie – Simulation & Gaming, 1993
Presents an interpolation methodology that duplicates and improves the results of mathematical functional relationships useful for designing business enterprise simulations and argues that interpolation is effective over the entire range of production and sales activity. (six references) (EA)
Descriptors: Algorithms, Business, Design, Economic Factors
Peer reviewed Peer reviewed
Bookstein, Abraham; And Others – Information Processing and Management, 1992
Discusses the problems of compressing a large textual database for storage on CD-ROM. A text-compression algorithm is presented, new algorithms for compression of indices are described, and the ARTFL (American and French Research on the Treasury of the French Language) database is used as an example. (14 references) (LRW)
Descriptors: Algorithms, Coding, Full Text Databases, Indexes
Previous Page | Next Page ยป
Pages: 1  |  2