Sciweavers

311 search results - page 40 / 63
» Better streaming algorithms for clustering problems
Sort
View
GECCO
2007
Springer
308views Optimization» more  GECCO 2007»
15 years 3 months ago
Multiobjective clustering with automatic k-determination for large-scale data
Web mining - data mining for web data - is a key factor of web technologies. Especially, web behavior mining has attracted a great deal of attention recently. Behavior mining invo...
Nobukazu Matake, Tomoyuki Hiroyasu, Mitsunori Miki...
74
Voted
NIPS
2003
14 years 11 months ago
Learning the k in k-means
When clustering a dataset, the right number k of clusters to use is often not obvious, and choosing k automatically is a hard algorithmic problem. In this paper we present an impr...
Greg Hamerly, Charles Elkan
CCGRID
2005
IEEE
15 years 3 months ago
n-Cycle: a set of algorithms for task distribution on a commodity grid
— The global internet is rich in commodity resources but scarce in specialized resources. We argue that a grid framework can achieve better performance if it separates management...
Ladislau Bölöni, Damla Turgut, Dan C. Ma...
KDD
2012
ACM
271views Data Mining» more  KDD 2012»
13 years 2 days ago
GigaTensor: scaling tensor analysis up by 100 times - algorithms and discoveries
Many data are modeled as tensors, or multi dimensional arrays. Examples include the predicates (subject, verb, object) in knowledge bases, hyperlinks and anchor texts in the Web g...
U. Kang, Evangelos E. Papalexakis, Abhay Harpale, ...
DASFAA
2003
IEEE
151views Database» more  DASFAA 2003»
15 years 2 months ago
Approximate String Matching in DNA Sequences
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...
Lok-Lam Cheng, David Wai-Lok Cheung, Siu-Ming Yiu