NotesFAQContact Us
Collection
Advanced
Search Tips
What Works Clearinghouse Rating
Showing 1,231 to 1,245 of 2,843 results Save | Export
Peer reviewed Peer reviewed
Burgin, Robert – Journal of the American Society for Information Science, 1995
Examines the retrieval effectiveness of five hierarchical clustering methods (single link, complete link, group average, Ward's method, and weighted average) as a function of indexing exhaustivity with four test collections. Evaluations of retrieval effectiveness are based on three measures of optimal retrieval performance. (Author/LRW)
Descriptors: Algorithms, Evaluation Methods, Indexing, Information Retrieval
Peer reviewed Peer reviewed
Kiers, Henk A. L.; ten Berge, Jos M. F. – Psychometrika, 1992
A procedure is described for minimizing a class of matrix trace functions, which is a refinement of an earlier procedure for minimizing the class of matrix trace functions using majorization. Several trial analyses demonstrate that the revised procedure is more efficient than the earlier majorization-based procedure. (SLD)
Descriptors: Algorithms, Equations (Mathematics), Least Squares Statistics, Mathematical Models
Peer reviewed Peer reviewed
ten Berge, Jos M. F. – Psychometrika, 1991
A globally optimal solution is presented for a class of functions composed of a linear regression function and a penalty function for the sums of squared regression weights. A completing-the-squares approach is used, rather than calculus, because it yields global minimality easily in two of three cases examined. (SLD)
Descriptors: Algorithms, Equations (Mathematics), Mathematical Models, Matrices
Peer reviewed Peer reviewed
Pring, Isobel – Information Services and Use, 1993
Discusses issues relevant to end users when choosing digital video technology. Topics addressed include Indeo video, an algorithm for the capture and compression of digital video; cross-platform capability; products from Intel, including possible future developments; and international standards for video. (LRW)
Descriptors: Algorithms, Futures (of Society), Hypermedia, Standards
Peer reviewed Peer reviewed
ten Berge, Jos M. F.; Zegers, Frits E. – Multivariate Behavioral Research, 1990
Arguments by J. Levin (1988) challenging the convergence properties of the Harman and Jones (1966) method of Minres factor analysis are shown to be invalid. Claims about the invalidity of a rank-one version of the Harman and Jones method are also refuted. (TJH)
Descriptors: Algorithms, Comparative Analysis, Equations (Mathematics), Factor Analysis
Peer reviewed Peer reviewed
DeSarbo, Wayne S.; And Others – Psychometrika, 1990
A nonspatial operationalization of the Krumhansl distance-density model of similarity is presented. The conceptual model and empirical evidence are reviewed. A nonspatial, tree-fitting methodology is described, which is sufficiently flexible to fit several competing hypotheses of similarity formation. Extensions to spatial models, three-way…
Descriptors: Algorithms, Cluster Analysis, Goodness of Fit, Mathematical Models
Peer reviewed Peer reviewed
Kim, Sehwan; Wurster, Leslie; Williams, Charles; Hepler, Nancy – Journal of Drug Education, 1998
Presents a model for resource allocation of state-prevention funds based on the relative need for prevention services measured in terms of composite risk-factor index scores computed for each county. Suggests that funding be based on the resource-allocation algorithms rather than the suggested amount of funding computed for each county.…
Descriptors: Algorithms, Prevention, Programs, Resource Allocation
Peer reviewed Peer reviewed
Byrne, Christopher C.; McCracken, Stephen A. – Journal of Information Science, 1999
Presents a domain-specific thesaurus for linguistic support of an information broker that employs an adaptive semantic-distance function based on pathfinder networks and algorithms for automated population by nominal compound interpretation and relational inheritance. Mathematical structure of thesauri and issues for further research are also…
Descriptors: Algorithms, Information Networks, Information Retrieval, Linguistics
Peer reviewed Peer reviewed
Madden, Andrew D. – Educational Research, 1999
Explains genetic algorithms, a means of generating logical rules that predict one variable by relating it to others. Describes how they can be applied to analysis of survey data. (SK)
Descriptors: Algorithms, Data Analysis, Educational Research, Nonparametric Statistics
Peer reviewed Peer reviewed
Chien, Lee-Feng – Information Processing & Management, 1999
Considers the need for keyphrase-extraction techniques in intelligent Chinese information retrieval and presents a PAT-tree-based adaptive approach, developed from the PATRICIA Algorithm (Practical Algorithm to Retrieve Information Coded in Alphanumeric). Discusses Internet utilization, automatic term suggestion, domain-specific lexicon…
Descriptors: Algorithms, Chinese, Dictionaries, Indexing
Peer reviewed Peer reviewed
Tanaka, Hideki; Kumano, Tadashi; Uratani, Noriyoshi; Ehara, Terumasa – Information Processing & Management, 1999
Presents a document-clustering algorithm that uses a term frequency vector for each document in a Japanese collection to produce a hierarchy in the form of a document classification tree. Introduces an application of this algorithm to a Japanese-to-English translation-aid system. (Author/LRW)
Descriptors: Algorithms, Cluster Grouping, Japanese, Structural Analysis (Linguistics)
Peer reviewed Peer reviewed
Horng, Jorng-Tzong; Yeh, Ching-Chang – Information Processing & Management, 2000
Proposes a novel approach to automatically retrieve keywords and then uses genetic algorithms to adapt the keyword weights. Discusses Chinese text retrieval, term frequency rating formulas, vector space models, bigrams, the PAT-tree structure for information retrieval, query vectors, and relevance feedback. (Author/LRW)
Descriptors: Algorithms, Chinese, Information Retrieval, Keywords
Peer reviewed Peer reviewed
Quinn, Robert J. – Australian Mathematics Teacher, 2000
Discusses an algorithm that converts a fraction in simplest form into a terminating decimal and allows students to explore the efficacy and conceptual bases of a mathematical algorithm. (ASK)
Descriptors: Algorithms, Fractions, High Schools, Mathematics Activities
Peer reviewed Peer reviewed
Deogun, Jitender S.; Choubey, Suresh K.; Raghavan, Vijay V.; Sever, Hayri – Journal of the American Society for Information Science, 1998
Develops and analyzes four algorithms for feature selection in the context of rough set methodology. Experimental results confirm the expected relationship between the time complexity of these algorithms and the classification accuracy of the resulting upper classifiers. When compared, results of upper classifiers perform better than lower…
Descriptors: Algorithms, Classification, Computation, Data Analysis
Peer reviewed Peer reviewed
Stocking, Martha L.; Lewis, Charles – Journal of Educational and Behavioral Statistics, 1998
Ensuring item and pool security in a continuous testing environment is explored through a new method of controlling exposure rate of items conditional on ability level in computerized testing. Properties of this conditional control on exposure rate, when used in conjunction with a particular adaptive testing algorithm, are explored using simulated…
Descriptors: Adaptive Testing, Algorithms, Computer Assisted Testing, Difficulty Level
Pages: 1  |  ...  |  79  |  80  |  81  |  82  |  83  |  84  |  85  |  86  |  87  |  ...  |  190