Sciweavers

1301 search results - page 87 / 261
» Default Clustering from Sparse Data Sets
Sort
View
CINQ
2004
Springer
116views Database» more  CINQ 2004»
14 years 29 days ago
A Survey on Condensed Representations for Frequent Sets
Abstract. Solving inductive queries which have to return complete collections of patterns satisfying a given predicate has been studied extensively the last few years. The specific...
Toon Calders, Christophe Rigotti, Jean-Franç...
KDD
2010
ACM
245views Data Mining» more  KDD 2010»
14 years 18 days ago
Flexible constrained spectral clustering
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...
Xiang Wang, Ian Davidson
ICDM
2006
IEEE
108views Data Mining» more  ICDM 2006»
14 years 3 months ago
Integrating Features from Different Sources for Music Information Retrieval
Efficient and intelligent music information retrieval is a very important topic of the 21st century. With the ultimate goal of building personal music information retrieval syste...
Tao Li, Mitsunori Ogihara, Shenghuo Zhu
EGPGV
2004
Springer
214views Visualization» more  EGPGV 2004»
14 years 2 months ago
Hierarchical Visualization and Compression of Large Volume Datasets Using GPU Clusters
We describe a system for the texture-based direct volume visualization of large data sets on a PC cluster equipped with GPUs. The data is partitioned into volume bricks in object ...
Magnus Strengert, Marcelo Magallón, Daniel ...
BMCBI
2010
139views more  BMCBI 2010»
13 years 9 months ago
A highly efficient multi-core algorithm for clustering extremely large datasets
Background: In recent years, the demand for computational power in computational biology has increased due to rapidly growing data sets from microarray and other high-throughput t...
Johann M. Kraus, Hans A. Kestler