659 search results - page 58 / 132 » Data mining with an ant colony optimization algorithm |
136
Voted
MSR
2006
ACM
15 years 9 months ago
2006
ACM
Similarity analysis of source code is helpful during development to provide, for instance, better support for code reuse. Consider a development environment that analyzes code whi...
123
click to vote
KDD
1999
ACM
15 years 7 months ago
1999
ACM
Several algorithms have been proposed for finding the “best,” “optimal,” or “most interesting” rule(s) in a database according to a variety of metrics including confid...
155
click to vote
KDD
2007
ACM
16 years 3 months ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
125
click to vote
KDD
2006
ACM
16 years 3 months ago
2006
ACM
Frequent coherent subgraphscan provide valuable knowledgeabout the underlying internal structure of a graph database, and mining frequently occurring coherent subgraphs from large...
138
Voted
VLDB
1998
ACM
15 years 7 months ago
1998
ACM
This paper deals with finding outliers (exceptions) in large, multidimensional datasets. The identification of outliers can lead to the discovery of truly unexpected knowledge in ...