5046 search results - page 271 / 1010 » Non-redundant data clustering |
177
Voted
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
Size and complexity of data repositories collaboratively created by Web users generate a need for new processing approaches. In this paper, we study the problem of detection of ï¬...
196
click to vote
KDD
2001
ACM
16 years 7 months ago
2001
ACM
Both document clustering and word clustering are well studied problems. Most existing algorithms cluster documents and words separately but not simultaneously. In this paper we pr...
170
click to vote
AUSDM
2007
Springer
15 years 10 months ago
2007
Springer
Population based real-life datasets often contain smaller clusters of unusual sub-populations. While these clusters, called `hot spots', are small and sparse, they are usuall...
203
click to vote
BMCBI
2011
14 years 10 months ago
2011
Background: Graphical models of network associations are useful for both visualizing and integrating multiple types of association data. Identifying modules, or groups of function...
168
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
We study the online clustering problem where data items arrive in an online fashion. The algorithm maintains a clustering of data items into similarity classes. Upon arrival of v, ...