Sciweavers

1836 search results - page 291 / 368
» Mining Clustering Dimensions
Sort
View
ICIP
2010
IEEE
15 years 1 months ago
Hyper-DEMIX: Blind source separation of hyperspectral images using local ML estimates
We propose a new method to unmix hyperspectral images. Our method exploits the structure of the material abundance maps by assuming that in some regions of the spatial dimension, ...
Simon Arberet
155
Voted
CVPR
2011
IEEE
14 years 7 months ago
Multiscale Geometric and Spectral Analysis of Plane Arrangements
Modeling data by multiple low-dimensional planes is an important problem in many applications such as computer vision and pattern recognition. In the most general setting where on...
Guangliang Chen, Mauro Maggioni
SIGMOD
2008
ACM
157views Database» more  SIGMOD 2008»
16 years 3 months ago
CRD: fast co-clustering on large datasets utilizing sampling-based matrix decomposition
The problem of simultaneously clustering columns and rows (coclustering) arises in important applications, such as text data mining, microarray analysis, and recommendation system...
Feng Pan, Xiang Zhang, Wei Wang 0010
143
Voted
ICDM
2009
IEEE
152views Data Mining» more  ICDM 2009»
15 years 1 months ago
A Sparsification Approach for Temporal Graphical Model Decomposition
Temporal causal modeling can be used to recover the causal structure among a group of relevant time series variables. Several methods have been developed to explicitly construct te...
Ning Ruan, Ruoming Jin, Victor E. Lee, Kun Huang
167
Voted
KDD
2012
ACM
200views Data Mining» more  KDD 2012»
13 years 6 months ago
Vertex neighborhoods, low conductance cuts, and good seeds for local community methods
The communities of a social network are sets of vertices with more connections inside the set than outside. We theoretically demonstrate that two commonly observed properties of s...
David F. Gleich, C. Seshadhri