Sciweavers

1215 search results - page 56 / 243
» Numbers in Multi-relational Data Mining
Sort
View
KDD
2005
ACM
104views Data Mining» more  KDD 2005»
16 years 7 days ago
Mining tree queries in a graph
We present an algorithm for mining tree-shaped patterns in a large graph. Novel about our class of patterns is that they can contain constants, and can contain existential nodes w...
Bart Goethals, Eveline Hoekx, Jan Van den Bussche
PKDD
1999
Springer
118views Data Mining» more  PKDD 1999»
15 years 4 months ago
Mining Possibilistic Set-Valued Rules by Generating Prime Disjunctions
We describe the problem of mining possibilistic set-valued rules in large relational tables containing categorical attributes taking a finite number of values. An example of such a...
Alexandr A. Savinov
ICDM
2002
IEEE
448views Data Mining» more  ICDM 2002»
15 years 4 months ago
Feature Selection Algorithms: A Survey and Experimental Evaluation
In view of the substantial number of existing feature selection algorithms, the need arises to count on criteria that enables to adequately decide which algorithm to use in certai...
Luis Carlos Molina, Lluís Belanche, À...
ICDM
2009
IEEE
162views Data Mining» more  ICDM 2009»
15 years 6 months ago
Accurate Estimation of the Degree Distribution of Private Networks
—We describe an efficient algorithm for releasing a provably private estimate of the degree distribution of a network. The algorithm satisfies a rigorous property of differenti...
Michael Hay, Chao Li, Gerome Miklau, David Jensen
PKDD
2007
Springer
147views Data Mining» more  PKDD 2007»
15 years 6 months ago
MINI: Mining Informative Non-redundant Itemsets
Frequent itemset mining assists the data mining practitioner in searching for strongly associated items (and transactions) in large transaction databases. Since the number of frequ...
Arianna Gallo, Tijl De Bie, Nello Cristianini