Fast mining of massive tabular data via approximate distance computations

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2002, Pages 605-614

  Cormode, Graham ^a   Indyk, Piotr ^b   Koudas, Nick ^c   Muthukrishnan, S ^c  

^a UNIVERSITY OF WARWICK   (United Kingdom)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CELLULAR RADIO SYSTEMS; COMPUTATIONAL METHODS; INTERNET; NETWORK PROTOCOLS; ROUTERS; TELECOMMUNICATION TRAFFIC;

APPROXIMATE DISTANCE COMPUTATIONS; TABULAR DATA;

DATA MINING;

EID: 0036215013     PISSN: 10844627     EISSN: None     Source Type: Journal    
DOI: 10.1109/ICDE.2002.994778     Document Type: Article

References (21)

1. On the surprising behavior of distance metrics in high dimensional space
2. Efficient similarity search in sequence databases
3. Spartan: A model-based semantic compression system for massive data tables
4. Virtual data warehousing, data publishing, and call details
5. Engineering the compression of massive tables: An experimental approach
6. A density-based algorithm for discovering clusters in large spatial databases with noise
7. Netscope: Traffic engineering for IP networks
8. Deriving traffic demands for operational IP networks: Methodology and experience
9. DEMON: Mining and monitoring evolving data
10. CURE: An efficient clustering algorithm for large databases
11. Stable distributions, psuedorandom generators, embeddings and data stream computation
12. Identifying representative trends in massive time series data sets using sketches
13. Metarule-guided mining of multi-dimensional association rules using data cubes
14. Efficient and effective clustering methods for spatial data mining
15. Mining optimized support rules for numeric attributes
16. Mining quantitative association rules in large relational tables
17. p norms
18. BIRCH: An efficient data clustering method for very large databases