Sciweavers

80 search results - page 7 / 16
» Approximate mining of frequent patterns on streams
Sort
View
KDD
2005
ACM
162views Data Mining» more  KDD 2005»
14 years 7 months ago
Discovering frequent topological structures from graph datasets
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...
Ruoming Jin, Chao Wang, Dmitrii Polshakov, Sriniva...
EDBT
2008
ACM
138views Database» more  EDBT 2008»
14 years 7 months ago
Mine your own business, mine others' news!
Major media companies such as The Financial Times, the Wall Street Journal or Reuters generate huge amounts of textual news data on a daily basis. Mining frequent patterns in this...
Boualem Benatallah, Guillaume Raschia, Noureddine ...
IDA
2011
Springer
13 years 2 months ago
A parallel, distributed algorithm for relational frequent pattern discovery from very large data sets
The amount of data produced by ubiquitous computing applications is quickly growing, due to the pervasive presence of small devices endowed with sensing, computing and communicatio...
Annalisa Appice, Michelangelo Ceci, Antonio Turi, ...
WWW
2004
ACM
14 years 8 months ago
On mining webclick streams for path traversal patterns
Mining user access patterns from a continuous stream of Web-clicks presents new challenges over traditional Web usage mining in a large static Web-click database. Modeling user ac...
Hua-Fu Li, Suh-Yin Lee, Man-Kwan Shan
ICDM
2007
IEEE
254views Data Mining» more  ICDM 2007»
14 years 1 months ago
Sampling for Sequential Pattern Mining: From Static Databases to Data Streams
Sequential pattern mining is an active field in the domain of knowledge discovery. Recently, with the constant progress in hardware technologies, real-world databases tend to gro...
Chedy Raïssi, Pascal Poncelet