Sciweavers

77 search results - page 14 / 16
» On the Anonymization of Sparse High-Dimensional Data
Sort
View
ICPP
2000
IEEE
13 years 11 months ago
A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary
BMCBI
2007
215views more  BMCBI 2007»
13 years 6 months ago
Learning causal networks from systems biology time course data: an effective model selection procedure for the vector autoregres
Background: Causal networks based on the vector autoregressive (VAR) process are a promising statistical tool for modeling regulatory interactions in a cell. However, learning the...
Rainer Opgen-Rhein, Korbinian Strimmer
SIGMOD
2011
ACM
203views Database» more  SIGMOD 2011»
12 years 9 months ago
Effective data co-reduction for multimedia similarity search
Multimedia similarity search has been playing a critical role in many novel applications. Typically, multimedia objects are described by high-dimensional feature vectors (or point...
Zi Huang, Heng Tao Shen, Jiajun Liu, Xiaofang Zhou
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
14 years 7 months ago
Efficient methods for topic model inference on streaming document collections
Topic models provide a powerful tool for analyzing large text collections by representing high dimensional data in a low dimensional subspace. Fitting a topic model given a set of...
Limin Yao, David M. Mimno, Andrew McCallum
NIPS
2001
13 years 8 months ago
Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering
Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motiva...
Mikhail Belkin, Partha Niyogi