Sciweavers

658 search results - page 102 / 132
» Arguing from Experience to Classifying Noisy Data
Sort
View
CVPR
2003
IEEE
14 years 9 months ago
Generalized Principal Component Analysis (GPCA)
This paper presents an algebro-geometric solution to the problem of segmenting an unknown number of subspaces of unknown and varying dimensions from sample data points. We represen...
René Vidal, Shankar Sastry, Yi Ma
ICDE
2008
IEEE
124views Database» more  ICDE 2008»
14 years 9 months ago
Mining Approximate Order Preserving Clusters in the Presence of Noise
Subspace clustering has attracted great attention due to its capability of finding salient patterns in high dimensional data. Order preserving subspace clusters have been proven to...
Mengsheng Zhang, Wei Wang 0010, Jinze Liu
SIGPRO
2010
122views more  SIGPRO 2010»
13 years 6 months ago
Parameter estimation for exponential sums by approximate Prony method
The recovery of signal parameters from noisy sampled data is a fundamental problem in digital signal processing. In this paper, we consider the following spectral analysis problem...
Daniel Potts, Manfred Tasche
KDD
2009
ACM
198views Data Mining» more  KDD 2009»
14 years 8 months ago
Heterogeneous source consensus learning via decision propagation and negotiation
Nowadays, enormous amounts of data are continuously generated not only in massive scale, but also from different, sometimes conflicting, views. Therefore, it is important to conso...
Jing Gao, Wei Fan, Yizhou Sun, Jiawei Han
WPES
2004
ACM
14 years 1 months ago
Assessing global disclosure risk in masked microdata
In this paper, we introduce a general framework for microdata and three disclosure risk measures (minimal, maximal and weighted). We classify the attributes from a given microdata...
Traian Marius Truta, Farshad Fotouhi, Daniel C. Ba...