Sciweavers

58 search results - page 11 / 12
» Privacy preserving sequential pattern mining in distributed ...
Sort
View
VLDB
2005
ACM
136views Database» more  VLDB 2005»
13 years 10 months ago
On k-Anonymity and the Curse of Dimensionality
In recent years, the wide availability of personal data has made the problem of privacy preserving data mining an important one. A number of methods have recently been proposed fo...
Charu C. Aggarwal
SPAA
1997
ACM
13 years 9 months ago
A Localized Algorithm for Parallel Association Mining
Discovery of association rules is an important database mining problem. Mining for association rules involves extracting patterns from large databases and inferring useful rules f...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, We...
KDD
2010
ACM
218views Data Mining» more  KDD 2010»
13 years 9 months ago
Online multiscale dynamic topic models
We propose an online topic model for sequentially analyzing the time evolution of topics in document collections. Topics naturally evolve with multiple timescales. For example, so...
Tomoharu Iwata, Takeshi Yamada, Yasushi Sakurai, N...
SIGKDD
2008
125views more  SIGKDD 2008»
13 years 5 months ago
Incremental pattern discovery on streams, graphs and tensors
Incremental pattern discovery targets streaming applications where the data continuously arrive incrementally. The questions are how to find patterns (main trends) incrementally; ...
Jimeng Sun
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
14 years 5 months ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...