Sciweavers

1403 search results - page 153 / 281
» Set cover algorithms for very large datasets
Sort
View
ADBIS
2006
Springer
165views Database» more  ADBIS 2006»
15 years 10 months ago
Fragmenting XML Documents via Structural Constraints
Abstract. XML query processors suffer from main-memory limitations that prevent them from processing large XML documents. While content-based predicates can be used to project down...
Angela Bonifati, Alfredo Cuzzocrea, Bruno Zinno
KDD
2012
ACM
197views Data Mining» more  KDD 2012»
13 years 8 months ago
On the separability of structural classes of communities
Three major factors govern the intricacies of community extraction in networks: (1) the application domain includes a wide variety of networks of fundamentally different natures,...
Bruno D. Abrahao, Sucheta Soundarajan, John E. Hop...
WSDM
2009
ACM
198views Data Mining» more  WSDM 2009»
16 years 28 days ago
Measuring the similarity between implicit semantic relations using web search engines
Measuring the similarity between implicit semantic relations is an important task in information retrieval and natural language processing. For example, consider the situation whe...
Danushka Bollegala, Yutaka Matsuo, Mitsuru Ishizuk...
160
Voted
SIGIR
2010
ACM
15 years 10 months ago
Positional relevance model for pseudo-relevance feedback
Pseudo-relevance feedback is an effective technique for improving retrieval results. Traditional feedback algorithms use a whole feedback document as a unit to extract words for ...
Yuanhua Lv, ChengXiang Zhai
163
Voted
ISICA
2007
Springer
16 years 8 days ago
Instant Message Clustering Based on Extended Vector Space Model
Instant intercommunion techniques such as Instant Messaging (IM) are widely popularized. Aiming at such kind of large scale masscommunication media, clustering on its text conte...
Le Wang, Yan Jia, Weihong Han