Sciweavers

4488 search results - page 120 / 898
» Focusing Search by Using Problem Solving Experience
Sort
View
GECCO
2005
Springer
108views Optimization» more  GECCO 2005»
15 years 9 months ago
Some theoretical results about the computation time of evolutionary algorithms
This paper focuses on the computation time of evolutionary algorithms. First, some exact expressions of the mean first hitting times of general evolutionary algorithms in finite...
Lixin X. Ding, Jinghu Yu
SIGIR
2006
ACM
15 years 9 months ago
Contextual search and name disambiguation in email using graphs
Similarity measures for text have historically been an important tool for solving information retrieval problems. In many interesting settings, however, documents are often closel...
Einat Minkov, William W. Cohen, Andrew Y. Ng
KDD
2003
ACM
175views Data Mining» more  KDD 2003»
16 years 3 months ago
Weighted Association Rule Mining using weighted support and significance framework
We address the issues of discovering significant binary relationships in transaction datasets in a weighted setting. Traditional model of association rule mining is adapted to han...
Feng Tao, Fionn Murtagh, Mohsen Farid
GECCO
2005
Springer
119views Optimization» more  GECCO 2005»
15 years 9 months ago
Improving GA search reliability using maximal hyper-rectangle analysis
In Genetic algorithms it is not easy to evaluate the confidence level in whether a GA run may have missed a complete area of good points, and whether the global optimum was found....
Chongshan Zhang, Khaled Rasheed
ICDE
2009
IEEE
135views Database» more  ICDE 2009»
16 years 5 months ago
Space-Constrained Gram-Based Indexing for Efficient Approximate String Search
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
Alexander Behm, Shengyue Ji, Chen Li, Jiaheng Lu