Sciweavers

2705 search results - page 184 / 541
» Privacy in Data Mining Using Formal Methods
Sort
View
KDD
2006
ACM
201views Data Mining» more  KDD 2006»
14 years 11 months ago
Polynomial association rules with applications to logistic regression
A new class of associations (polynomial itemsets and polynomial association rules) is presented which allows for discovering nonlinear relationships between numeric attributes wit...
Szymon Jaroszewicz
SIGMOD
2008
ACM
144views Database» more  SIGMOD 2008»
14 years 10 months ago
Mining significant graph patterns by leap search
With ever-increasing amounts of graph data from disparate sources, there has been a strong need for exploiting significant graph patterns with user-specified objective functions. ...
Xifeng Yan, Hong Cheng, Jiawei Han, Philip S. Yu
SSDBM
2006
IEEE
123views Database» more  SSDBM 2006»
14 years 4 months ago
Mining Hierarchies of Correlation Clusters
The detection of correlations between different features in high dimensional data sets is a very important data mining task. These correlations can be arbitrarily complex: One or...
Elke Achtert, Christian Böhm, Peer Kröge...
AOSD
2009
ACM
14 years 2 months ago
The dataflow pointcut: a formal and practical framework
Some security concerns are sensitive to flow of information in a program execution. The dataflow pointcut has been proposed by Masuhara and Kawauchi in order to easily implement s...
Dima Alhadidi, Amine Boukhtouta, Nadia Belblidia, ...
DATAMINE
1999
108views more  DATAMINE 1999»
13 years 10 months ago
A Survey of Methods for Scaling Up Inductive Algorithms
Abstract. One of the de ning challenges for the KDD research community is to enable inductive learning algorithms to mine very large databases. This paper summarizes, categorizes, ...
Foster J. Provost, Venkateswarlu Kolluri