Sciweavers

109 search results - page 13 / 22
» Document clustering based on non-negative matrix factorizati...
Sort
View
PAKDD
2007
ACM
224views Data Mining» more  PAKDD 2007»
15 years 3 months ago
Graph Nodes Clustering Based on the Commute-Time Kernel
This work presents a kernel method for clustering the nodes of a weighted, undirected, graph. The algorithm is based on a two-step procedure. First, the sigmoid commute-time kernel...
Luh Yen, François Fouss, Christine Decaeste...
74
Voted
SIBGRAPI
2005
IEEE
15 years 3 months ago
True Factor Analysis in Medical Imaging: Dealing with High-Dimensional Spaces
This article presents a new method for discovering hidden patterns in high-dimensional dataset resulting from image registration. It is based on true factor analysis, a statistica...
Alexei Manso Correa Machado
SIGIR
2004
ACM
15 years 3 months ago
GaP: a factor model for discrete data
We present a probabilistic model for a document corpus that combines many of the desirable features of previous models. The model is called “GaP” for Gamma-Poisson, the distri...
John F. Canny
ICASSP
2009
IEEE
14 years 7 months ago
Probabilistic matrix tri-factorization
Nonnegative matrix tri-factorization (NMTF) is a 3-factor decomposition of a nonnegative data matrix, X USV , where factor matrices, U, S, and V , are restricted to be nonnegativ...
Jiho Yoo, Seungjin Choi
SIGIR
2008
ACM
14 years 9 months ago
Knowledge transformation from word space to document space
In most IR clustering problems, we directly cluster the documents, working in the document space, using cosine similarity between documents as the similarity measure. In many real...
Tao Li, Chris H. Q. Ding, Yi Zhang 0005, Bo Shao