583 search results - page 82 / 117 » Mining evolving data streams for frequent patterns |
KDD
2004
ACM
15 years 10 months ago
2004
ACM
The primary goal of Web usage mining is the discovery of patterns in the navigational behavior of Web users. Standard approaches, such as clustering of user sessions and discoveri...
KDD
2009
ACM
15 years 10 months ago
2009
ACM
Research in relational data mining has two major directions: finding global models of a relational database and the discovery of local relational patterns within a database. While...
KDD
2007
ACM
15 years 10 months ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
KDD
2006
ACM
15 years 10 months ago
2006
ACM
Mining frequent patterns is a general and important issue in data mining. Complex and unstructured (or semi-structured) datasets have appeared in major data mining applications, i...
KDD
2006
ACM
15 years 10 months ago
2006
ACM
Observed in many applications, there is a potential need of extracting a small set of frequent patterns having not only high significance but also low redundancy. The significance...