Sciweavers

ML
2010
ACM
141views Machine Learning» more  ML 2010»
13 years 3 months ago
Relational retrieval using a combination of path-constrained random walks
Scientific literature with rich metadata can be represented as a labeled directed graph. This graph representation enables a number of scientific tasks such as ad hoc retrieval o...
Ni Lao, William W. Cohen
PAMI
2008
197views more  PAMI 2008»
13 years 4 months ago
LEGClust - A Clustering Algorithm Based on Layered Entropic Subgraphs
Hierarchical clustering is a stepwise clustering method usually based on proximity measures between objects or sets of objects from a given data set. The most common proximity meas...
Jorge M. Santos, Joaquim Marques de Sá, Lu&...
DAWAK
2008
Springer
13 years 6 months ago
Towards the Automatic Construction of Conceptual Taxonomies
Abstract. In this paper we investigate the possibility of an automatic construction of conceptual taxonomies and evaluate the achievable results. The hierarchy is performed by Ward...
Dino Ienco, Rosa Meo
IMC
2009
ACM
13 years 11 months ago
Scalable proximity estimation and link prediction in online social networks
Proximity measures quantify the closeness or similarity between nodes in a social network and form the basis of a range of applications in social sciences, business, information t...
Han Hee Song, Tae Won Cho, Vacha Dave, Yin Zhang, ...
KDD
2006
ACM
122views Data Mining» more  KDD 2006»
14 years 5 months ago
Measuring and extracting proximity in networks
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...
Yehuda Koren, Stephen C. North, Chris Volinsky