1913 search results - page 180 / 383 » Using Data Mining in MURA Graphic Problems |
140
click to vote
KDD
1995
ACM
15 years 7 months ago
1995
ACM
One objective of knowledge acquisition using inductive modeling has been the development of correct and effectively computable descriptions that can also be assimilated and used b...
134
click to vote
COMPUTE
2010
ACM
15 years 8 months ago
2010
ACM
The single minimum support (minsup) based frequent pattern mining approaches like Apriori and FP-growth suffer from“rare item problem”while extracting frequent patterns. That...
151
Voted
CINQ
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Solving inductive queries which have to return complete collections of patterns satisfying a given predicate has been studied extensively the last few years. The specific...
148
click to vote
KDD
1997
ACM
15 years 7 months ago
1997
ACM
Discovery of association rules is an important problem in database mining. In this paper we present new algorithms for fast association mining, which scan the database only once, ...
140
click to vote
KDD
2005
ACM
16 years 4 months ago
2005
ACM
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...