Sciweavers

766 search results - page 64 / 154
» Clustering high dimensional data using subspace and projecte...
Sort
View
ICPR
2002
IEEE
14 years 9 months ago
Fast Hierarchical Clustering Based on Compressed Data
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...
Erendira Rendon, Ricardo Barandela
BMCBI
2007
162views more  BMCBI 2007»
13 years 8 months ago
Three-Dimensional Phylogeny Explorer: Distinguishing paralogs, lateral transfer, and violation of "molecular clock" assumption w
Background: Construction and interpretation of phylogenetic trees has been a major research topic for understanding the evolution of genes. Increases in sequence data and complexi...
Namshin Kim, Christopher Lee
BMCBI
2007
128views more  BMCBI 2007»
13 years 8 months ago
Model order selection for bio-molecular data clustering
Background: Cluster analysis has been widely applied for investigating structure in bio-molecular data. A drawback of most clustering algorithms is that they cannot automatically ...
Alberto Bertoni, Giorgio Valentini
DEXAW
2010
IEEE
204views Database» more  DEXAW 2010»
13 years 9 months ago
Scalable Recursive Top-Down Hierarchical Clustering Approach with Implicit Model Selection for Textual Data Sets
Automatic generation of taxonomies can be useful for a wide area of applications. In our application scenario a topical hierarchy should be constructed reasonably fast from a large...
Markus Muhr, Vedran Sabol, Michael Granitzer
ICDE
2003
IEEE
148views Database» more  ICDE 2003»
14 years 10 months ago
Dynamic Clustering of Evolving Streams with a Single Pass
Stream data is common in many applications, e.g., stock quotes, merchandize sales record, system logs, etc.. It is of great importance to analyze these stream data. As one of the ...
Jiong Yang