Sciweavers

902 search results - page 48 / 181
» Supporting self-adaptation in streaming data mining applicat...
Sort
View
KDD
2005
ACM
139views Data Mining» more  KDD 2005»
14 years 9 months ago
Reasoning about sets using redescription mining
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
Mohammed Javeed Zaki, Naren Ramakrishnan
ISCI
2006
58views more  ISCI 2006»
13 years 9 months ago
Streaming data reduction using low-memory factored representations
Many special purpose algorithms exist for extracting information from streaming data. Constraints are imposed on the total memory and on the average processing time per data item....
David Littau, Daniel Boley
VLDB
2010
ACM
144views Database» more  VLDB 2010»
13 years 7 months ago
Methods for finding frequent items in data streams
The frequent items problem is to process a stream of items and find all items occurring more than a given fraction of the time. It is one of the most heavily studied problems in d...
Graham Cormode, Marios Hadjieleftheriou
ICDE
2006
IEEE
108views Database» more  ICDE 2006»
14 years 10 months ago
On the Inverse Classification Problem and its Applications
In this paper, we discuss the inverse classification problem, in which we desire to define the features of an incomplete record in such a way that will result in a desired class l...
Charu C. Aggarwal, Chen Chen, Jiawei Han
KDD
2008
ACM
274views Data Mining» more  KDD 2008»
14 years 9 months ago
Data mining using high performance data clouds: experimental studies using sector and sphere
We describe the design and implementation of a high performance cloud that we have used to archive, analyze and mine large distributed data sets. By a cloud, we mean an infrastruc...
Robert L. Grossman, Yunhong Gu