Sciweavers

4541 search results - page 338 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
RECOMB
2002
Springer
16 years 4 months ago
Probabilistic hierarchical clustering for biological data
Biological data, such as gene expression profiles or protein sequences, is often organized in a hierarchy of classes, where the instances assigned to "nearby" classes in...
Eran Segal, Daphne Koller
JCST
2008
121views more  JCST 2008»
15 years 4 months ago
Clustering Text Data Streams
Abstract Clustering text data streams is an important issue in data mining community and has a number of applications such as news group filtering, text crawling, document organiza...
Yubao Liu, Jiarong Cai, Jian Yin, Ada Wai-Chee Fu
SIGIR
2003
ACM
15 years 9 months ago
ReCoM: reinforcement clustering of multi-type interrelated data objects
Most existing clustering algorithms cluster highly related data objects such as Web pages and Web users separately. The interrelation among different types of data objects is eith...
Jidong Wang, Hua-Jun Zeng, Zheng Chen, Hongjun Lu,...
ICML
2005
IEEE
16 years 5 months ago
Clustering through ranking on manifolds
Clustering aims to find useful hidden structures in data. In this paper we present a new clustering algorithm that builds upon the consistency method (Zhou, et.al., 2003), a semi-...
Markus Breitenbach, Gregory Z. Grudic
SODA
2010
ACM
200views Algorithms» more  SODA 2010»
16 years 1 months ago
Fully-Functional Succinct Trees
We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any n-node static tree can be represented in 2n + o(n) bits and a l...
Kunihiko Sadakane, Gonzalo Navarro