Sciweavers

1887 search results - page 238 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
CIKM
2007
Springer
14 years 3 months ago
Effective top-k computation in retrieving structured documents with term-proximity support
Modern web search engines are expected to return top-k results efficiently given a query. Although many dynamic index pruning strategies have been proposed for efficient top-k com...
Mingjie Zhu, Shuming Shi, Mingjing Li, Ji-Rong Wen
ATAL
2007
Springer
14 years 3 months ago
Letting loose a SPIDER on a network of POMDPs: generating quality guaranteed policies
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are a popular approach for modeling multi-agent systems acting in uncertain domains. Given the signi...
Pradeep Varakantham, Janusz Marecki, Yuichi Yabu, ...
KDD
2010
ACM
197views Data Mining» more  KDD 2010»
13 years 7 months ago
Semi-supervised feature selection for graph classification
The problem of graph classification has attracted great interest in the last decade. Current research on graph classification assumes the existence of large amounts of labeled tra...
Xiangnan Kong, Philip S. Yu
TKDE
2008
111views more  TKDE 2008»
13 years 9 months ago
A Point Symmetry-Based Clustering Technique for Automatic Evolution of Clusters
In this paper, a new symmetry-based genetic clustering algorithm is proposed which automatically evolves the number of clusters as well as the proper partitioning from a data set. ...
Sanghamitra Bandyopadhyay, Sriparna Saha
SDM
2009
SIAM
157views Data Mining» more  SDM 2009»
14 years 6 months ago
MUSK: Uniform Sampling of k Maximal Patterns.
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
Mohammad Al Hasan, Mohammed Javeed Zaki