Sciweavers

767 search results - page 31 / 154
» On Clustering Using Random Walks
Sort
View
COLING
2008
13 years 10 months ago
Using Hidden Markov Random Fields to Combine Distributional and Pattern-Based Word Clustering
Word clustering is a conventional and important NLP task, and the literature has suggested two kinds of approaches to this problem. One is based on the distributional similarity a...
Nobuhiro Kaji, Masaru Kitsuregawa
ICMLA
2004
13 years 10 months ago
RAIN: data clustering using randomized interactions between data points
Abstract-- This paper introduces a generalization of the Gravitational Clustering Algorithm proposed by Gomez et all in [1]. First, it is extended in such a way that not only the G...
Jonatan Gómez, Olfa Nasraoui, Elizabeth Leo...
WWW
2002
ACM
14 years 9 months ago
The structure of broad topics on the web
The Web graph is a giant social network whose properties have been measured and modeled extensively in recent years. Most such studies concentrate on the graph structure alone, an...
Soumen Chakrabarti, Mukul Joshi, Kunal Punera, Dav...
ERCIMDL
2010
Springer
158views Education» more  ERCIMDL 2010»
13 years 9 months ago
Ranking Entities Using Web Search Query Logs
Abstract Searching for entities is an emerging task in Information Retrieval for which the goal is finding well defined entities instead of documents matching the query terms. In t...
Bodo Billerbeck, Gianluca Demartini, Claudiu S. Fi...
CCS
2009
ACM
14 years 3 months ago
ShadowWalker: peer-to-peer anonymous communication using redundant structured topologies
Peer-to-peer approaches to anonymous communication promise to eliminate the scalability concerns and central vulnerability points of current networks such as Tor. However, the P2P...
Prateek Mittal, Nikita Borisov