Sciweavers

237 search results - page 26 / 48
» Mining Frequent Itemsets Using Re-Usable Data Structure
Sort
View
ICDM
2003
IEEE
154views Data Mining» more  ICDM 2003»
14 years 29 days ago
Frequent Sub-Structure-Based Approaches for Classifying Chemical Compounds
In this paper we study the problem of classifying chemical compound datasets. We present a sub-structure-based classification algorithm that decouples the sub-structure discovery...
Mukund Deshpande, Michihiro Kuramochi, George Kary...
GFKL
2007
Springer
184views Data Mining» more  GFKL 2007»
13 years 11 months ago
FSMTree: An Efficient Algorithm for Mining Frequent Temporal Patterns
Research in the field of knowledge discovery from temporal data recently focused on a new type of data: interval sequences. In contrast to event sequences interval sequences contai...
Steffen Kempe, Jochen Hipp, Rudolf Kruse
PAKDD
2010
ACM
171views Data Mining» more  PAKDD 2010»
13 years 6 months ago
Summarizing Multidimensional Data Streams: A Hierarchy-Graph-Based Approach
With the rapid development of information technology, many applications have to deal with potentially infinite data streams. In such a dynamic context, storing the whole data stre...
Yoann Pitarch, Anne Laurent, Pascal Poncelet
CIKM
2009
Springer
14 years 9 days ago
A novel approach for privacy mining of generic basic association rules
Data mining can extract important knowledge from large data collections - but sometimes these collections are split among various parties. Privacy concerns may prevent the parties...
Moez Waddey, Pascal Poncelet, Sadok Ben Yahia
ICCS
2007
Springer
14 years 1 months ago
Mining Frequent Closed Unordered Trees Through Natural Representations
Abstract. Many knowledge representation mechanisms consist of linkbased structures; they may be studied formally by means of unordered trees. Here we consider the case where labels...
José L. Balcázar, Albert Bifet, Anto...