Sciweavers

92 search results - page 4 / 19
» Warehousing and Mining Massive RFID Data Sets
Sort
View
ICPP
2000
IEEE
13 years 11 months ago
A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary
ICDM
2007
IEEE
175views Data Mining» more  ICDM 2007»
14 years 1 months ago
gApprox: Mining Frequent Approximate Patterns from a Massive Network
Recently, there arise a large number of graphs with massive sizes and complex structures in many new applications, such as biological networks, social networks, and the Web, deman...
Chen Chen, Xifeng Yan, Feida Zhu, Jiawei Han
SIGKDD
2008
149views more  SIGKDD 2008»
13 years 7 months ago
Knowledge discovery from sensor data (SensorKDD)
Wide-area sensor infrastructures, remote sensors, RFIDs, and wireless sensor networks yield massive volumes of disparate, dynamic, and geographically distributed data. As such sen...
Ranga Raju Vatsavai, Olufemi A. Omitaomu, Joao Gam...
KDD
2001
ACM
163views Data Mining» more  KDD 2001»
14 years 7 months ago
The "DGX" distribution for mining massive, skewed data
Skewed distributions appear very often in practice. Unfortunately, the traditional Zipf distribution often fails to model them well. In this paper, we propose a new probability di...
Zhiqiang Bi, Christos Faloutsos, Flip Korn
CINQ
2004
Springer
177views Database» more  CINQ 2004»
14 years 21 days ago
Generic Pattern Mining Via Data Mining Template Library
Frequent Pattern Mining (FPM) is a very powerful paradigm for mining informative and useful patterns in massive, complex datasets. In this paper we propose the Data Mining Templat...
Mohammed Javeed Zaki, Nilanjana De, Feng Gao, Paol...