Sciweavers

1422 search results - page 167 / 285
» Test Generation Algorithms Based on Preorder Relations
Sort
View
161
Voted
SDM
2004
SIAM
194views Data Mining» more  SDM 2004»
15 years 4 months ago
Finding Frequent Patterns in a Large Sparse Graph
Graph-based modeling has emerged as a powerful abstraction capable of capturing in a single and unified framework many of the relational, spatial, topological, and other characteri...
Michihiro Kuramochi, George Karypis
125
Voted
DATAMINE
2006
157views more  DATAMINE 2006»
15 years 3 months ago
Data Clustering with Partial Supervision
Clustering with partial supervision finds its application in situations where data is neither entirely nor accurately labeled. This paper discusses a semisupervised clustering algo...
Abdelhamid Bouchachia, Witold Pedrycz
GECCO
2005
Springer
160views Optimization» more  GECCO 2005»
15 years 9 months ago
On the complexity of hierarchical problem solving
Competent Genetic Algorithms can efficiently address problems in which the linkage between variables is limited to a small order k. Problems with higher order dependencies can onl...
Edwin D. de Jong, Richard A. Watson, Dirk Thierens
157
Voted
WWW
2009
ACM
15 years 10 months ago
StatSnowball: a statistical approach to extracting entity relationships
Traditional relation extraction methods require pre-specified relations and relation-specific human-tagged examples. Bootstrapping systems significantly reduce the number of tr...
Jun Zhu, Zaiqing Nie, Xiaojiang Liu, Bo Zhang, Ji-...
269
Voted
IRFC
2011
Springer
14 years 6 months ago
Word Clouds of Multiple Search Results
Search engine result pages (SERPs) are known as the most expensive real estate on the planet. Most queries yield millions of organic search results, yet searchers seldom look beyon...
Rianne Kaptein, Jaap Kamps