Sciweavers

2489 search results - page 393 / 498
» On the Subgroup Distance Problem
Sort
View
ADMA
2009
Springer
186views Data Mining» more  ADMA 2009»
16 years 1 months ago
Mining Compressed Repetitive Gapped Sequential Patterns Efficiently
Mining frequent sequential patterns from sequence databases has been a central research topic in data mining and various efficient mining sequential patterns algorithms have been p...
Yongxin Tong, Zhao Li, Dan Yu, Shilong Ma, Zhiyuan...
WEBI
2009
Springer
16 years 29 days ago
Rigorous Probabilistic Trust-Inference with Applications to Clustering
The World Wide Web has transformed into an environment where users both produce and consume information. In order to judge the validity of information, it is important to know how...
Thomas DuBois, Jennifer Golbeck, Aravind Srinivasa...
DIS
2009
Springer
16 years 29 days ago
Contrasting Sequence Groups by Emerging Sequences
Abstract. Group comparison per se is a fundamental task in many scientific endeavours but is also the basis of any classifier. Contrast sets and emerging patterns contrast betwee...
Kang Deng, Osmar R. Zaïane
ESWS
2009
Springer
16 years 29 days ago
Ranking Approximate Answers to Semantic Web Queries
We consider the problem of a user querying semistructured data such as RDF without knowing its structure. In these circumstances, it is helpful if the querying system can perform a...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...
KI
2009
Springer
16 years 28 days ago
Planning with h +  in Theory and Practice
Abstract. Many heuristic estimators for classical planning are based on the socalled delete relaxation, which ignores negative effects of planning operators. Ideally, such heuristi...
Christoph Betz, Malte Helmert