Sciweavers

391 search results - page 20 / 79
» Efficient Data Mining for Path Traversal Patterns
Sort
View
KDD
2008
ACM
192views Data Mining» more  KDD 2008»
14 years 8 months ago
Partial least squares regression for graph mining
Attributed graphs are increasingly more common in many application domains such as chemistry, biology and text processing. A central issue in graph mining is how to collect inform...
Hiroto Saigo, Koji Tsuda, Nicole Krämer
KDD
2009
ACM
167views Data Mining» more  KDD 2009»
14 years 2 months ago
Anomalous window discovery through scan statistics for linear intersecting paths (SSLIP)
Anomalous windows are the contiguous groupings of data points. In this paper, we propose an approach for discovering anomalous windows using Scan Statistics for Linear Intersectin...
Lei Shi, Vandana Pursnani Janeja
KDD
2005
ACM
103views Data Mining» more  KDD 2005»
14 years 8 months ago
Fast discovery of unexpected patterns in data, relative to a Bayesian network
We consider a model in which background knowledge on a given domain of interest is available in terms of a Bayesian network, in addition to a large database. The mining problem is...
Szymon Jaroszewicz, Tobias Scheffer
VLDB
2008
ACM
147views Database» more  VLDB 2008»
14 years 8 months ago
Providing k-anonymity in data mining
In this paper we present extended definitions of k-anonymity and use them to prove that a given data mining model does not violate the k-anonymity of the individuals represented in...
Arik Friedman, Ran Wolff, Assaf Schuster
KDD
2008
ACM
135views Data Mining» more  KDD 2008»
14 years 8 months ago
Effective and efficient itemset pattern summarization: regression-based approaches
In this paper, we propose a set of novel regression-based approaches to effectively and efficiently summarize frequent itemset patterns. Specifically, we show that the problem of ...
Ruoming Jin, Muad Abu-Ata, Yang Xiang, Ning Ruan