venkatesh-infrequentitem-2007.pdf (359.11 kB)
Infrequent item mining in multiple data streams
conference contribution
posted on 2007-01-01, 00:00 authored by Budhaditya Saha, M Lazarescu, Svetha VenkateshSvetha VenkateshThe problem of extracting infrequent patterns from streams and building associations between these patterns is becoming increasingly relevant today as many events of interest such as attacks in network data or unusual stories in news data occur rarely. The complexity of the problem is compounded when a system is required to deal with data from multiple streams. To address these problems, we present a framework that combines the time based association mining with a pyramidal structure that allows a rolling analysis of the stream and maintains a synopsis of the data without requiring increasing memory resources. We apply the algorithms and show the usefulness of the techniques. © 2007 Crown Copyright.
History
Event
IEEE International Conference on Data Mining (17th : 2007 : Omaha, NE)Pagination
569 - 574Publisher
IEEELocation
Omaha, NEPlace of publication
Omaha, NEStart date
2007-10-28End date
2007-10-31ISBN-13
9780769530338ISBN-10
0769530338Language
engNotes
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.Publication classification
E1.1 Full written paper - refereedCopyright notice
2007, IEEEEditor/Contributor(s)
IEEETitle of proceedings
Data Mining Workshops, 2007. ICDM Workshops 2007. Seventh IEEE International Conference on; ICDM 2007Usage metrics
Categories
No categories selectedLicence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC