Sciweavers

4955 search results - page 161 / 991
» Multiple Pattern Databases
Sort
View
FLAIRS
2000
15 years 6 months ago
Discovering Structural Patterns in Telecommunications Data
With the increasing amount and complexity of data being collected, there is an urgent need to create automated techniques for mining the data. In particular, data being generated ...
Andi Baritchi, Diane J. Cook, Lawrence B. Holder
CIKM
2009
Springer
15 years 9 months ago
An empirical study on using hidden markov model for search interface segmentation
This paper describes a hidden Markov model (HMM) based approach to perform search interface segmentation. Automatic processing of an interface is a must to access the invisible co...
Ritu Khare, Yuan An
RCIS
2010
15 years 3 months ago
A Tree-based Approach for Efficiently Mining Approximate Frequent Itemsets
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
Jia-Ling Koh, Yi-Lang Tu
ICDM
2006
IEEE
114views Data Mining» more  ICDM 2006»
15 years 10 months ago
Incremental Mining of Frequent Query Patterns from XML Queries for Caching
Existing studies for mining frequent XML query patterns mainly introduce a straightforward candidate generate-and-test strategy and compute frequencies of candidate query patterns...
Guoliang Li, Jianhua Feng, Jianyong Wang, Yong Zha...
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
15 years 9 months ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu