Sciweavers

72 search results - page 15 / 15
» Random search can outperform mutation
Sort
View
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
14 years 11 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
CIKM
2009
Springer
14 years 5 months ago
Helping editors choose better seed sets for entity set expansion
Sets of named entities are used heavily at commercial search engines such as Google, Yahoo and Bing. Acquiring sets of entities typically consists of combining semi-supervised exp...
Vishnu Vyas, Patrick Pantel, Eric Crestan