Exploratory mining in cube space

Data Mining and Knowledge Discovery

Volumn 15, Issue 1, 2007, Pages 29-54

  Ramakrishnan, Raghu ^a   Chen, Bee Chung ^a  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

Cube; Data mining; Exploratory analysis; Feature space; Multidimensional data model; OLAP

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; LEARNING SYSTEMS; MATHEMATICAL MODELS; OPTIMIZATION; STATISTICS;

EXPLORATORY ANALYSIS; FEATURE SPACES; MULTIDIMENSIONAL DATA MODELS;

DATA MINING;

EID: 34547349909     PISSN: 13845810     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10618-007-0063-0     Document Type: Article

References (31)

1. Agrawal R, Imielinski T, Swami A (1993) Mining association rules between sets of items in large databases. ACM SIGMOD Record 22(2):207-216
2. Barbará D, Wu X (2001) Loglinear-based quasi cubes. J Intell Inf Syst 16(3):255-276
3. Breiman L (2001) Random forests. Mach Learn 45(1):5-32
4. Burdick D, Deshpande PM, Jayram TS, Ramakrishnan R, Vaithyanathan S (2005) OLAP over uncertain and imprecise data. In: Proceedings of the 31st international conference on very large data bases (VLDB 05), pp 970-981
5. Burdick D, Deshpande PM, Jayram TS, Ramakrishnan R, Vaithyanathan S (2006) Efficient allocation algorithms for olap over imprecise data. In: Proceedings of the 32nd international conference on very large data bases (VLDB 06), pp 391-402
6. Chen Y, Dong G, Han J, Wah BW, Wang J (2002) Multi-dimensional regression analysis of time-series data streams. In: Proceedings of the 28th international conference on very large data bases (VLDB 02), pp 323-334
7. Chen B-C, Chen L, Lin Y, Ramakrishnan R (2005a) Prediction cubes. In: Proceedings of the 31st international conference on very large data bases (VLDB 05), pp 982-993
8. Chen Y, Dong G, Han J, Pei J, Wah BW, Wang J (2005b) Stream cube: an architecture for multi-dimensional analysis of data streams. Distribut Parallel Databases 18(2):173-197
9. Chen B-C, Ramakrishnan R, Shavlik JW, Tamma P (2006a) Bellwether analysis: predicting global aggregates from local regions. In: Proceedings of the 32nd international conference on very large data bases (VLDB 06), pp 655-666
10. Chen L, Ramakrishnan R, Barford P, Chen B-C, Yegneswaran V (2006b) Composite subset measures. In: Proceedings of the 32nd international conference on very large data bases (VLDB 06), pp 403-414
11. Danna A, Gandy O (2002) All the glitters is not gold: digging beneath the surface of data mining. J Bus Ethics 40:373-386
12. Dobra A, Fienberg SE (2001) Bounds for cell entries in contingency tables induced by fixed marginal totals with applications to disclosure limitation. Stat J U N 18:363-371
13. Dong G, Han J, Lam J, Pei J, Wang K (2001) Mining multi-dimensional constrained gradients in data cubes. In: Proceedings of the 27th international conference on very large data bases (VLDB 01), pp 321-330
14. Fagin R, Guha R, Kumar R, Novak J, Sivakumar D, Tomkins A (2005a) Multi-structural databases. In: Proceedings of the 24th ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems (PODS 05), pp 184-195
15. Fagin R, Kolaitis PG, Kumar R, Novak J, Sivakumar D, Tomkins A (2005b) Efficient implementation of large-scale multi-structural databases. In: Proceedings of the 31th international conference on very large data bases (VLDB 05), pp 958-969
16. Gray J, Chaudhuri S, Bosworth A, Layman A, Reichart D, Venkatrao M (1997) Data cube: a relational aggregate operator generalizing group-by, cross-tab, and sub-tables. J Data Min Knowl Discov 1:29-53
17. Han J (1998) Towards on-line analytical mining in large databases. ACM SIGMOD Record 27(1):97-107
18. Harinarayan V, Rajaraman A, Ullman JD (1996) Implementing data cubes efficiently. ACM SIGMOD Record 25(2):205-216
19. Imielinski T, Khachiyan L, Abdulghani A (2002) Cubegrades: generalizing association rules. J Data Min Knowl Disov 6:219-257
20. Kifer D, Gehrke J (2006) Injecting utility into anonymized datasets. In: Proceedings of ACM SIGMOD international conference on management of data (SIGMOD 06), pp 217-228
21. LeFevre K, DeWitt D, Ramakrishnan R (2006) Workload-aware anonymization. In: Proceeding of the international conference on knowledge discovery and data mining (KDD 06), pp. 277-286
22. Machanavajjhala A, Gehrke J, Kifer D, Venkitasubramaniam M (2006) l-Diversity: privacy beyond k-anonymity. In: Proceedings of the 22nd international conference on data engineering (ICDE 06), pp 24.
23. Margaritis D, Faloutsos C, Thrun S (2001) NetCube: a scalable tool for fast data mining and compression. In: Proceedings of the 27th international conference on very large data bases (VLDB 01), pp 311-320
24. Mitchell TM (1997) Machine learning. McGraw-Hill, New York
25. Parsons L, Haque E, Liu H (2004) Subspace clustering for high dimensional data: a review. ACM SIGKDD Explor Newsl 6(1):90-105
26. Samarati P, Sweeney L (1998) Protecting privacy when disclosing information: k-anonymity and its enforcement through generalization and suppression. Technical Report SRI-CSL-98-04, SRI Computer Science Laboratory
27. Sarawagi S (1999) Explaining differences in multidimensional aggregates. In: Proceedings of the 25th international conference on very large data bases (VLDB 99), pp 42-53
28. Sarawagi S (2001) User-cognizant multidimensional analysis. VLDB J 10(2-3):224-239
29. Sarawagi S, Agrawal R, Megiddo N (1998) Discovery-driven exploration of OLAP data cubes. In: Proceedings of the 6th international conference on extending database technology (EDBT 98), 168-182
30. Sathe G, Sarawagi S (2001) Intelligent rollups in multidimensional OLAP data. In: Proceedings of the 27th international conference on very large data bases (VLDB 01), pp 531-540
31. Witten IH, Frank E (2000) Data mining: practical machine learning tools with java implementations. Morgan Kaufmann, San Francisco