Sciweavers

268 search results - page 13 / 54
» Learning Pairwise Similarity for Data Clustering
Sort
View
AAAI
2008
13 years 9 months ago
Clustering via Random Walk Hitting Time on Directed Graphs
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
Mo Chen, Jianzhuang Liu, Xiaoou Tang
KDD
2002
ACM
154views Data Mining» more  KDD 2002»
14 years 7 months ago
Mining Protein Contact Maps
The 3D conformation of a protein may be compactly represented in a symmetrical, square, boolean matrix of pairwise, inter-residue contacts, or "contact map". The contact...
Jingjing Hu, Xiaolan Shen, Yu Shao, Chris Bystroff...
ICML
2006
IEEE
14 years 8 months ago
On a theory of learning with similarity functions
Kernel functions have become an extremely popular tool in machine learning, with an attractive theory as well. This theory views a kernel as implicitly mapping data points into a ...
Maria-Florina Balcan, Avrim Blum
WWW
2006
ACM
14 years 1 months ago
Using proportional transportation similarity with learned element semantics for XML document clustering
This paper proposes a novel approach to measuring XML document similarity by taking into account the semantics between XML elements. The motivation of the proposed approach is to ...
Xiaojun Wan, Jianwu Yang
JMLR
2006
108views more  JMLR 2006»
13 years 7 months ago
Learning Spectral Clustering, With Application To Speech Separation
Spectral clustering refers to a class of techniques which rely on the eigenstructure of a similarity matrix to partition points into disjoint clusters, with points in the same clu...
Francis R. Bach, Michael I. Jordan