Sciweavers

1836 search results - page 295 / 368
» Mining Clustering Dimensions
Sort
View
138
Voted
TASLP
2011
14 years 10 months ago
Time-Domain Blind Separation of Audio Sources on the Basis of a Complete ICA Decomposition of an Observation Space
—Time-domain algorithms for blind separation of audio sources can be classified as being based either on a partial or complete decomposition of an observation space. The decompo...
Zbynek Koldovský, Petr Tichavský
131
Voted
ICASSP
2011
IEEE
14 years 7 months ago
Co-clustering as multilinear decomposition with sparse latent factors
The K-means clustering problem seeks to partition the columns of a data matrix in subsets, such that columns in the same subset are ‘close’ to each other. The co-clustering pr...
Evangelos E. Papalexakis, Nicholas D. Sidiropoulos
EMNLP
2011
14 years 3 months ago
Cross-Cutting Models of Lexical Semantics
Context-dependent word similarity can be measured over multiple cross-cutting dimensions. For example, lung and breath are similar thematically, while authoritative and superfici...
Joseph Reisinger, Raymond J. Mooney
160
Voted
AAAI
2010
15 years 4 months ago
A Two-Dimensional Topic-Aspect Model for Discovering Multi-Faceted Topics
This paper presents the Topic-Aspect Model (TAM), a Bayesian mixture model which jointly discovers topics and aspects. We broadly define an aspect of a document as a characteristi...
Michael Paul, Roxana Girju
CORR
2010
Springer
114views Education» more  CORR 2010»
15 years 3 months ago
Settling the Polynomial Learnability of Mixtures of Gaussians
Given data drawn from a mixture of multivariate Gaussians, a basic problem is to accurately estimate the mixture parameters. We give an algorithm for this problem that has running ...
Ankur Moitra, Gregory Valiant