1314 search results - page 31 / 263 » Approximate data mining in very large relational data |
SIGKDD
2002
13 years 8 months ago
2002
The primary aim of most data mining algorithms is to facilitate the discovery of concise and interpretable information from large amounts of data. However, many of the current for...
KDD
1994
ACM
14 years 18 days ago
1994
ACM
Pre-Pruning and Post-Pruning are two standard methods of dealing with noise in concept learning. Pre-Pruning methods are very efficient, while Post-Pruning methods typically are m...
DSS
2007
13 years 8 months ago
2007
We present two algorithms for learning large-scale gene regulatory networks from microarray data: a modified informationtheory-based Bayesian network algorithm and a modified asso...
SIGMOD
2001
ACM
14 years 8 months ago
2001
ACM
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
KDD
2002
ACM
14 years 9 months ago
2002
ACM
Graphs are an increasingly important data source, with such important graphs as the Internet and the Web. Other familiar graphs include CAD circuits, phone records, gene sequences...