Sciweavers

138 search results - page 8 / 28
» Divide-and-Conquer Strategies for Process Mining
Sort
View
CPC
2002
75views more  CPC 2002»
13 years 7 months ago
The Minesweeper Game: Percolation And Complexity
We study a model motivated by the minesweeper game. In this model one starts with percolation of mines on the sites of the lattice Zd , and then tries to find an infinite path of ...
Elchanan Mossel
CN
2006
163views more  CN 2006»
13 years 7 months ago
A framework for mining evolving trends in Web data streams using dynamic learning and retrospective validation
The expanding and dynamic nature of the Web poses enormous challenges to most data mining techniques that try to extract patterns from Web data, such as Web usage and Web content....
Olfa Nasraoui, Carlos Rojas, Cesar Cardona
RCIS
2010
13 years 6 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
KDD
1995
ACM
148views Data Mining» more  KDD 1995»
13 years 11 months ago
Learning Arbiter and Combiner Trees from Partitioned Data for Scaling Machine Learning
Knowledge discovery in databases has become an increasingly important research topic with the advent of wide area network computing. One of the crucial problems we study in this p...
Philip K. Chan, Salvatore J. Stolfo
ICDM
2007
IEEE
175views Data Mining» more  ICDM 2007»
14 years 2 months ago
gApprox: Mining Frequent Approximate Patterns from a Massive Network
Recently, there arise a large number of graphs with massive sizes and complex structures in many new applications, such as biological networks, social networks, and the Web, deman...
Chen Chen, Xifeng Yan, Feida Zhu, Jiawei Han