ACM Home Page
Please provide us with feedback. Feedback
Knowledge discovery in very large databases
Full text PdfPdf (92 KB)
Source SEKE; Vol. 27 archive
Proceedings of the 14th international conference on Software engineering and knowledge engineering table of contents
Ischia, Italy
SESSION: Keynotes table of contents
Pages: 15 - 15  
Year of Publication: 2002
ISBN:1-58113-556-4
Author
Xindong Wu  University of Vermont
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 36,   Citation Count: 0
Additional Information:

abstract   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/568760.568764
What is a DOI?

ABSTRACT

Dealing with very large databases is one of the defining challenges in data mining research and development. When a data base is not a static repository of data, or if the data come from different data sources and putting all data together might amass a huge database for centralized processing, knowledge discovery in such data environments cannot be a one-time process. Existing techniques include data sampling, windowing, bagging, boosting, batch learning, hierarchical meta-learning, and parallel and distributed data mining. This talk will provide a review on these techniques, and present our own recent research efforts on multi-layer induction and synthesizing association rules from different data sources.