Sciweavers

63 search results - page 4 / 13
» Finding k-dominant skylines in high dimensional space
Sort
View
CIDM
2007
IEEE
14 years 3 days 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...
DCG
2008
104views more  DCG 2008»
13 years 5 months ago
Finding the Homology of Submanifolds with High Confidence from Random Samples
Recently there has been a lot of interest in geometrically motivated approaches to data analysis in high dimensional spaces. We consider the case where data is drawn from sampling...
Partha Niyogi, Stephen Smale, Shmuel Weinberger
ICDE
2010
IEEE
222views Database» more  ICDE 2010»
13 years 4 months ago
Finding Clusters in subspaces of very large, multi-dimensional datasets
Abstract— We propose the Multi-resolution Correlation Cluster detection (MrCC), a novel, scalable method to detect correlation clusters able to analyze dimensional data in the ra...
Robson Leonardo Ferreira Cordeiro, Agma J. M. Trai...
CVPR
2004
IEEE
14 years 7 months ago
Inference of Multiple Subspaces from High-Dimensional Data and Application to Multibody Grouping
Multibody grouping is a representative of applying subspace constraints in computer vision tasks. Under linear projection models, feature points of multibody reside in multiple su...
Zhimin Fan, Jie Zhou, Ying Wu
BMCBI
2006
202views more  BMCBI 2006»
13 years 5 months ago
Spectral embedding finds meaningful (relevant) structure in image and microarray data
Background: Accurate methods for extraction of meaningful patterns in high dimensional data have become increasingly important with the recent generation of data types containing ...
Brandon W. Higgs, Jennifer W. Weller, Jeffrey L. S...