767 search results - page 30 / 154 » On Clustering Using Random Walks |
SEFM
2007
IEEE
14 years 2 months ago
2007
IEEE
Directed model checking algorithms focus computation resources in the error-prone areas of concurrent systems. The algorithms depend on some empirical analysis to report their per...
BMCBI
2008
13 years 8 months ago
2008
Background: Recent years have seen the development of various pathway-based methods for the analysis of microarray gene expression data. These approaches have the potential to bri...
ICPR
2006
IEEE
14 years 9 months ago
2006
IEEE
This paper exploits the properties of the commute time for the purposes of graph matching. Our starting point is the random walk on the graph, which is determined by the heat-kern...
WIRN
2005
Springer
14 years 2 months ago
2005
Springer
We present an algorithmic scheme for unsupervised cluster ensembles, based on randomized projections between metric spaces, by which a substantial dimensionality reduction is obtai...
EMNLP
2010
13 years 6 months ago
2010
Graph-based methods have gained attention in many areas of Natural Language Processing (NLP) including Word Sense Disambiguation (WSD), text summarization, keyword extraction and ...