Sciweavers

542 search results - page 96 / 109
» Unsupervised Learning with Permuted Data
Sort
View
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
13 years 12 months ago
Fast query execution for retrieval models based on path-constrained random walks
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
Ni Lao, William W. Cohen
KDD
2006
ACM
115views Data Mining» more  KDD 2006»
14 years 8 months ago
Supervised probabilistic principal component analysis
Principal component analysis (PCA) has been extensively applied in data mining, pattern recognition and information retrieval for unsupervised dimensionality reduction. When label...
Shipeng Yu, Kai Yu, Volker Tresp, Hans-Peter Krieg...
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
14 years 8 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
RECOMB
2009
Springer
14 years 8 months ago
Spatial Clustering of Multivariate Genomic and Epigenomic Information
The combination of fully sequence genomes and new technologies for high density arrays and ultra-rapid sequencing enables the mapping of generegulatory and epigenetics marks on a g...
Rami Jaschek, Amos Tanay
ICCV
2001
IEEE
14 years 10 months ago
Separating Appearance from Deformation
By representing images and image prototypes by linear subspaces spanned by "tangent vectors" (derivatives of an image with respect to translation, rotation, etc.), impre...
Nebojsa Jojic, Patrice Simard, Brendan J. Frey, Da...