Sciweavers

50 search results - page 4 / 10
» Using the fractal dimension to cluster datasets
Sort
View
SDM
2009
SIAM
176views Data Mining» more  SDM 2009»
14 years 8 months ago
Constraint-Based Subspace Clustering.
In high dimensional data, the general performance of traditional clustering algorithms decreases. This is partly because the similarity criterion used by these algorithms becomes ...
Élisa Fromont, Adriana Prado, Céline...
ISBI
2011
IEEE
13 years 2 months ago
Segmentation of anatomical branching structures based on texture features and graph cut
Segmentation of tree-like structure within medical imaging modalities, such as x-ray, MRI, ultrasound, etc., is an important step for analyzing branching patterns involved in many...
Tatyana Nuzhnaya, Erkang Cheng, Haibin Ling, Despi...
VLDB
2007
ACM
174views Database» more  VLDB 2007»
14 years 11 months ago
An adaptive and dynamic dimensionality reduction method for high-dimensional indexing
Abstract The notorious "dimensionality curse" is a wellknown phenomenon for any multi-dimensional indexes attempting to scale up to high dimensions. One well-known approa...
Heng Tao Shen, Xiaofang Zhou, Aoying Zhou
ICDE
2007
IEEE
176views Database» more  ICDE 2007»
14 years 5 months ago
Finding Important People in Large News Video Databases Using Multimodal and Clustering Analysis
The wide availability of large scale databases requires more efficient and scalable tools for data understanding and knowledge discovery. In this paper, we present a method to ...
Duy-Dinh Le, Shin'ichi Satoh, Michael E. Houle, Da...
IDEAL
2010
Springer
13 years 8 months ago
Approximating the Covariance Matrix of GMMs with Low-Rank Perturbations
: Covariance matrices capture correlations that are invaluable in modeling real-life datasets. Using all d2 elements of the covariance (in d dimensions) is costly and could result ...
Malik Magdon-Ismail, Jonathan T. Purnell