Sciweavers

783 search results - page 7 / 157
» Communities from seed sets
Sort
View
ACL
2009
13 years 6 months ago
Reducing Semantic Drift with Bagging and Distributional Similarity
Iterative bootstrapping algorithms are typically compared using a single set of handpicked seeds. However, we demonstrate that performance varies greatly depending on these seeds,...
Tara McIntosh, James R. Curran
SDM
2007
SIAM
137views Data Mining» more  SDM 2007»
13 years 9 months ago
Are approximation algorithms for consensus clustering worthwhile?
Consensus clustering has emerged as one of the principal clustering problems in the data mining community. In recent years the theoretical computer science community has generated...
Michael Bertolacci, Anthony Wirth
HT
2003
ACM
14 years 1 months ago
Extracting evolution of web communities from a series of web archives
Recent advances in storage technology make it possible to store a series of large Web archives. It is now an exciting challenge for us to observe evolution of the Web. In this pap...
Masashi Toyoda, Masaru Kitsuregawa
SIGIR
2009
ACM
14 years 2 months ago
Approximating true relevance distribution from a mixture model based on irrelevance data
Pseudo relevance feedback (PRF), which has been widely applied in IR, aims to derive a distribution from the top n pseudo relevant documents D. However, these documents are often ...
Peng Zhang, Yuexian Hou, Dawei Song
EMNLP
2008
13 years 9 months ago
Automatic Set Expansion for List Question Answering
This paper explores the use of set expansion (SE) to improve question answering (QA) when the expected answer is a list of entities belonging to a certain class. Given a small set...
Richard C. Wang, Nico Schlaefer, William W. Cohen,...