337 search results - page 53 / 68 » On Weak Markov's Principle |
ICML
2007
IEEE
16 years 1 months ago
2007
IEEE
We consider spectral clustering and transductive inference for data with multiple views. A typical example is the web, which can be described by either the hyperlinks between web ...
ICML
2002
IEEE
16 years 1 months ago
2002
IEEE
This paper addresses cost-sensitive classification in the setting where there are costs for measuring each attribute as well as costs for misclassification errors. We show how to ...
83
Voted
WWW
2005
ACM
16 years 1 months ago
2005
ACM
PageRank is defined as the stationary state of a Markov chain depending on a damping factor that spreads uniformly part of the rank. The choice of is eminently empirical, and in...
105
Voted
KDD
2004
ACM
16 years 23 days ago
2004
ACM
Unsupervised clustering can be significantly improved using supervision in the form of pairwise constraints, i.e., pairs of instances labeled as belonging to same or different clu...
113
click to vote
RECOMB
2003
Springer
16 years 20 days ago
2003
Springer
We propose a framework for modeling sequence motifs based on the maximum entropy principle (MEP). We recommend approximating short sequence motif distributions with the maximum en...