Sciweavers

376 search results - page 56 / 76
» Efficient Indexing Structures for Mining Frequent Patterns
Sort
View
ICDE
2007
IEEE
190views Database» more  ICDE 2007»
14 years 11 days ago
CPS-tree: A Compact Partitioned Suffix Tree for Disk-based Indexing on Large Genome Sequences
Suffix tree is an important data structure for indexing a long sequence (like a genome sequence) or a concatenation of sequences. It finds many applications in practice, especiall...
Swee-Seong Wong, Wing-Kin Sung, Limsoon Wong
KDD
2004
ACM
171views Data Mining» more  KDD 2004»
14 years 9 months ago
Integrating Web Conceptual Modeling and Web Usage Mining
We present a case study about the application of the inductive database approach to the analysis of Web logs. We consider rich XML Web logs ? called conceptual logs ? that are gen...
Rosa Meo, Pier Luca Lanzi, Maristella Matera, Robe...
ICDE
2008
IEEE
154views Database» more  ICDE 2008»
14 years 9 months ago
Butterfly: Protecting Output Privacy in Stream Mining
Abstract-- Privacy preservation in data mining demands protecting both input and output privacy. The former refers to sanitizing the raw data itself before performing mining. The l...
Ting Wang, Ling Liu
KDD
2009
ACM
239views Data Mining» more  KDD 2009»
14 years 9 months ago
Tell me something I don't know: randomization strategies for iterative data mining
There is a wide variety of data mining methods available, and it is generally useful in exploratory data analysis to use many different methods for the same dataset. This, however...
Heikki Mannila, Kai Puolamäki, Markus Ojala, ...
KDD
2007
ACM
227views Data Mining» more  KDD 2007»
14 years 9 months ago
Fast best-effort pattern matching in large attributed graphs
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...
Hanghang Tong, Christos Faloutsos, Brian Gallagher...