Sciweavers

766 search results - page 8 / 154
» Clustering high dimensional data using subspace and projecte...
Sort
View
PR
2006
116views more  PR 2006»
13 years 8 months ago
Shared farthest neighbor approach to clustering of high dimensionality, low cardinality data
Clustering algorithms are routinely used in biomedical disciplines, and are a basic tool in bioinformatics. Depending on the task at hand, there are two most popular options, the ...
Stefano Rovetta, Francesco Masulli
CVPR
2005
IEEE
14 years 10 months ago
Subspace Analysis Using Random Mixture Models
In [1], three popular subspace face recognition methods, PCA, Bayes, and LDA were analyzed under the same framework and an unified subspace analysis was proposed. However, since t...
Xiaogang Wang, Xiaoou Tang
BMCBI
2007
123views more  BMCBI 2007»
13 years 8 months ago
Robust clustering in high dimensional data using statistical depths
Background: Mean-based clustering algorithms such as bisecting k-means generally lack robustness. Although componentwise median is a more robust alternative, it can be a poor cent...
Yuanyuan Ding, Xin Dang, Hanxiang Peng, Dawn Wilki...
CIDM
2007
IEEE
14 years 2 months ago
Scalable Clustering for Large High-Dimensional Data Based on Data Summarization
Clustering large data sets with high dimensionality is a challenging data-mining task. This paper presents a framework to perform such a task efficiently. It is based on the notio...
Ying Lai, Ratko Orlandic, Wai Gen Yee, Sachin Kulk...
DEXA
2009
Springer
151views Database» more  DEXA 2009»
14 years 3 months ago
Detecting Projected Outliers in High-Dimensional Data Streams
Abstract. In this paper, we study the problem of projected outlier detection in high dimensional data streams and propose a new technique, called Stream Projected Ouliter deTector ...
Ji Zhang, Qigang Gao, Hai H. Wang, Qing Liu, Kai X...