NotesFAQContact Us
Collection
Advanced
Search Tips
Laws, Policies, & Programs
What Works Clearinghouse Rating
Showing 91 to 105 of 173 results Save | Export
Peer reviewed Peer reviewed
Tamine, Lynda; Chrisment, Claude; Boughanem, Mohand – Information Processing & Management, 2003
Explains the use of genetic algorithms to combine results from multiple query evaluations to improve relevance in information retrieval. Discusses niching techniques, relevance feedback techniques, and evolution heuristics, and compares retrieval results obtained by both genetic multiple query evaluation and classical single query evaluation…
Descriptors: Algorithms, Comparative Analysis, Evolution, Genetics
Peer reviewed Peer reviewed
Martin-Bautista, Maria J.; Vila, Maria-Amparo; Larsen, Henrik Legind – Journal of the American Society for Information Science, 1999
Presents an approach to a Genetic Information Retrieval Agent Filter (GIRAF) that filters and ranks documents retrieved from the Internet according to users' preferences by using a Genetic Algorithm and fuzzy set theory to handle the imprecision of users' preferences and users' evaluation of the retrieved documents. (Author/LRW)
Descriptors: Algorithms, Genetics, Information Retrieval, Internet
Peer reviewed Peer reviewed
Stejic, Zoran; Takama, Yasufumi; Hirota, Kaoru – Information Processing & Management, 2003
Proposes local similarity pattern (LSP) as a new method for computing digital image similarity. Topics include optimizing similarity computation based on genetic algorithm; relevance feedback; and an evaluation of LSP on five databases that showed an increase in retrieval precision over other methods for computing image similarity. (Author/LRW)
Descriptors: Algorithms, Databases, Evaluation Methods, Genetics
Peer reviewed Peer reviewed
Direct linkDirect link
Brusco, Michael J.; Steinley, Douglas – Psychometrika, 2007
Perhaps the most common criterion for partitioning a data set is the minimization of the within-cluster sums of squared deviation from cluster centroids. Although optimal solution procedures for within-cluster sums of squares (WCSS) partitioning are computationally feasible for small data sets, heuristic procedures are required for most practical…
Descriptors: Heuristics, Behavioral Sciences, Mathematics, Item Response Theory
Peer reviewed Peer reviewed
Vrajitoru, Dana – Information Processing & Management, 1998
In information retrieval (IR), the aim of genetic algorithms (GA) is to help a system to find, in a huge documents collection, a good reply to a query expressed by the user. Analysis of phenomena seen during the implementation of a GA for IR has led to a new crossover operation, which is introduced and compared to other learning methods.…
Descriptors: Algorithms, Comparative Analysis, Information Retrieval, Information Seeking
Peer reviewed Peer reviewed
Chen, Hsinchun – Journal of the American Society for Information Science, 1995
Presents an overview of artificial-intelligence-based inductive learning techniques and their use in information science research. Three methods are discussed: the connectionist Hopfield network; the symbolic ID3/ID5R; evolution-based genetic algorithms. The knowledge representations and algorithms of these methods are examined in the context of…
Descriptors: Artificial Intelligence, Indexing, Induction, Information Processing
Peer reviewed Peer reviewed
Losee, Robert M. – Information Processing & Management, 1996
The grammars of natural languages may be learned by using genetic algorithm systems such as LUST (Linguistics Using Sexual Techniques) that reproduce and mutate grammatical rules and parts-of-speech tags. In document retrieval or filtering systems, applying tags to the list of terms representing a document provides additional information about…
Descriptors: Algorithms, Artificial Intelligence, Expert Systems, Information Retrieval
Peer reviewed Peer reviewed
Robertson, Alexander M.; Willett, Peter – Journal of Documentation, 1996
Describes a genetic algorithm (GA) that assigns weights to query terms in a ranked-output document retrieval system. Experiments showed the GA often found weights slightly superior to those produced by deterministic weighting (F4). Many times, however, the two methods gave the same results and sometimes the F4 results were superior, indicating…
Descriptors: Algorithms, Comparative Analysis, Information Retrieval, Online Searching
Zafra, Amelia; Ventura, Sebastian – International Working Group on Educational Data Mining, 2009
The ability to predict a student's performance could be useful in a great number of different ways associated with university-level learning. In this paper, a grammar guided genetic programming algorithm, G3P-MI, has been applied to predict if the student will fail or pass a certain course and identifies activities to promote learning in a…
Descriptors: Foreign Countries, Programming, Academic Achievement, Grades (Scholastic)
Peer reviewed Peer reviewed
PDF on ERIC Download full text
Zhang, Jinming – ETS Research Report Series, 2005
This study derived an expectation-maximization (EM) algorithm for estimating the parameters of multidimensional item response models. A genetic algorithm (GA) was developed to be used in the maximization step in each EM cycle. The focus of the EM-GA algorithm developed in this paper was on multidimensional items with "mixed structure."…
Descriptors: Item Response Theory, Computation, Mathematics, Simulation
Peer reviewed Peer reviewed
Li, Heng; Tang, Sandy; Man, K. F.; Love, Peter E. D. – Internet Research, 2002
Describes an intelligent Web-based construction project management system called VHBuild.com which integrates project management, knowledge management, and artificial intelligence technologies. Highlights include an information flow model; time-cost optimization based on genetic algorithms; rule-based drawing interpretation; and a case-based…
Descriptors: Algorithms, Artificial Intelligence, Construction Management, Construction Programs
Peer reviewed Peer reviewed
Clark, Robin – Language Acquisition, 1992
Most recent approaches to language learnability and acquisition have assumed that parameter setting is largely a deductive process. This article develops the thesis that parameter setting is correctly viewed as nondeductive. This approach uses natural selection, as simulated by a genetic algorithm, to simulate parameter setting. (90 references)…
Descriptors: Grammar, Language Acquisition, Linguistic Theory, Models
Peer reviewed Peer reviewed
Baker, Bruce D. – Economics of Education Review, 2001
Explores whether flexible nonlinear models (including neural networks and genetic algorithms) can reveal otherwise unexpected patterns of relationship in typical school-productivity data. Applying three types of algorithms alongside regression modeling to school-level data in 183 elementary schools proves the hypothesis and reveals new directions…
Descriptors: Algorithms, Elementary Education, Evaluation Methods, Mathematical Models
Northwest Regional Educational Lab., Portland, OR. – 1998
The sixth session of IT@EDU98 consisted of seven papers on the topic of the learning machine--Vietnamese based human-computer interface, and was chaired by Phan Viet Hoang (Informatics College, Singapore). "Knowledge Based Approach for English Vietnamese Machine Translation" (Hoang Kiem, Dinh Dien) presents the knowledge base approach,…
Descriptors: Algorithms, Character Recognition, Color, Educational Technology
Peer reviewed Peer reviewed
Johnson, Andrew; Fotouhi, Farshad – Information Systems, 1996
Discussion of hypermedia systems focuses on a comparison of two types of adaptive algorithm (genetic algorithm and neural network) in clustering hypermedia documents. These clusters allow the user to index into the nodes to find needed information more quickly, since clustering is "personalized" based on the user's paths rather than…
Descriptors: Algorithms, Cluster Grouping, Comparative Analysis, Electronic Text
Pages: 1  |  2  |  3  |  4  |  5  |  6  |  7  |  8  |  9  |  10  |  11  |  12