Sciweavers

581 search results - page 24 / 117
» Fast Hierarchical Clustering Based on Compressed Data
Sort
View
CIBB
2008
14 years 4 days ago
Unsupervised Stability-Based Ensembles to Discover Reliable Structures in Complex Bio-molecular Data
The assessment of the reliability of clusters discovered in bio-molecular data is a central issue in several bioinformatics problems. Several methods based on the concept of stabil...
Alberto Bertoni, Giorgio Valentini
SDM
2009
SIAM
114views Data Mining» more  SDM 2009»
14 years 7 months ago
GAD: General Activity Detection for Fast Clustering on Large Data.
In this paper, we propose GAD (General Activity Detection) for fast clustering on large scale data. Within this framework we design a set of algorithms for different scenarios: (...
Jiawei Han, Liangliang Cao, Sangkyum Kim, Xin Jin,...
MSV
2004
13 years 11 months ago
MABAC - Matrix Based Clustering Algorithm
Clustering is a prominent method in the data mining field. It is a discovery process that groups data such that intra cluster similarity is maximized and the inter cluster similar...
Yonghui Chen, Alan P. Sprague, Kevin D. Reilly
SGP
2007
14 years 16 days ago
Fast normal vector compression with bounded error
We present two methods for lossy compression of normal vectors through quantization using "base" polyhedra. The first revisits subdivision-based quantization. The second...
Eric J. Griffith, Michal Koutek, Frits H. Post
ATS
2003
IEEE
76views Hardware» more  ATS 2003»
14 years 3 months ago
STAGE: A Decoding Engine Suitable for Multi-Compressed Test Data
: Most of the recently discussed test stimulus data compression techniques are based on the low care bit densities found in typical scan test vectors. Data reduction primarily is a...
Bernd Koenemann