Microeconomic analysis using dominant relationship analysis

Knowledge and Information Systems

Volumn 30, Issue 1, 2012, Pages 179-211

  Zhu, Ling ^a   Li, Cuiping ^a,b   Tung, Anthony K H ^c   Wang, Shan ^a,b  

^a Beijing Key Laboratory of Big Data Management and Analysis Methods   (China)

^b RENMIN UNIVERSITY OF CHINA   (China)

^c NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Dominance relationship; Maintenance; Microeconomic analysis; Query processing; Skyline

Indexed keywords

EID: 84855544915     PISSN: 02191377     EISSN: 02193116     Source Type: Journal    
DOI: 10.1007/s10115-010-0337-5     Document Type: Article

References (36)

1. Agarwal S, Agrawal R, Deshpande P, Gupta A, Naughton J, Ramakrishnan R, Sarawagi S (1996) On the computation of multidimensional aggregates. In: Proceedings of the 22th international conference on very large data bases, pp 506-521.
2. Beyer K, Ramakrishnan R (1999) Bottom-up computation of sparse and iceberg cubes. In: Proceedings of the 1999 ACM SIGMOD international conference on management of data, pp 359-370.
3. Birkhoff G (1973) Lattice theory. American Mathematical Society Colloquium Publications, Rhode Island.
4. Börzsönyi S, Kossmann D, Stocker K (2001) The skyline operator. In: Proceedings of the 17th international conference on data engineering, pp 421-430.
5. Brijs T, Swinnen G, Vanhoof K, Wets G (1999) Using association rules for product assortment decisions: a case study. In: Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining, pp 254-260.
6. Chen Q, Hsu M, Dayal U (2000) A Data-Warehouse/OLAP framework for scalable telecommunication tandem traffic analysis. In: Proceedings of the 16th international conference on data engineering, pp 201-210.
7. Ester M, Ge R, Jin W, Hu Z (2004) Amicroeconomic data mining problem: customer-oriented catalog segmentation. In: Proceedings of the 10th ACM SIGKDD international conference on knowledge discovery and data mining, pp 557-562.
8. Forman G (2008) Quantifying counts and costs via classification. Data MinKnowl Discov 17(2):164-206.
9. Geng L, Hamilton H (2006) Interestingness measures for data mining: a survey ACM. Comput Surv 38(3):1-31.
10. Gray J, Bosworth A, Layman A, Pirahesh H (1996) Data cube: a relational aggregation operator generalizing group-by, cross-tab, and sub-total. In: Proceedings of the 12th international conference on data engineering, pp 152-159.
11. Gray J, Chaudhuri S, Bosworth A, Layman A, Reichart D, Venkatrao M, Pellow F, Pirahesh H (1997) Data cube: a relational aggregation operator generalizing group-by, cross-tab, and sub totals. J Data Min Knowl Discov 1(1):29-53.
12. Harinarayan V, Rajaraman A, Ullman J (1996) Implementing data cubes efficiently. In: Proceedings of the 1996 ACM SIGMOD international conference on management of data, pp 205-216.
13. Ho C, Agrawal R, Megiddo N, Srikant R (1997) Range queries in OLAP data cubes. In: Proceedings of the 1997 ACM SIGMOD international conference on management of data, pp 73-88.
14. Huang Z, Sun S, Wang W (2009) Efficient mining of skyline objects in subspaces over data streams. Knowledge and information systems.
15. Ilyas I, Beskales G, Soliman M (2008) A survey of Top-k query processing techniques in relational database systems. ACM Comput Surveys 40(4):1-58.
16. Keim D, Hinneburg A (1999) Optimal grid-clustering: towards breaking the curse of dimensionality in high-dimensional clustering. In: Proceedings of the 22th international conference on very large data bases, pp 506-517.
17. Kleinberg J, Papadimitriou C, Raghavan P (1998) A microeconomic view of data mining. Data Min Knowl Discov 2(4):311-322.
18. Kleinberg J, Papadimitriou C, Raghavan P (2004) Segmentation problems. J ACM (JACM) 51(2): 263-280.
19. Kossmann D, Ramsak F, Rost S (2002) Shooting stars in the sky: an online algorithm for skyline queries. In: Proceedings of the 28th international conference on very large data bases, pp 275-286.
20. Lakshmanan L, Pei J, Han J (2002) Quotient cube: how to summarize the semantics of a data cube. In: Proceedings of the 28th international conference on very large data bases, pp 778-789.
21. Li C, OOi B, Tung AKH, Wang S (2006) DADA: A data cube for dominate relationship analysis. In: Proceedings of the 2006 ACM SIGMOD international conference on management of data, pp 659-670.
22. Papadias D, Tao Y, Fu G, Seeger B (2003) An optimal and progressive algorithm for skyline queries. In: Proceedings of the 2003 ACM SIGMOD international conference on management of data, pp 467-478.
23. Pei J, Jin W, Ester M, Tao Y (2005) Catching the best views of skyline: a semantic approach based on decisive subspaces. In: Proceedings of the 31th international conference on very large data bases, pp 253-264.
24. Ross K, Srivastava D (1997) Fast computation of sparse datacubes. In: Proceedings of the 23th international conference on very large data bases, pp 116-125.
25. Roussopoulos N, Kotidis Y, Roussopoulos M (1997) Cubetree: organization of and bulk incremental updates on the data cube. In: Proceedings of the 1996 ACM SIGMOD international conference on management of data, pp 89-99.
26. Seeger B, Kriegel H (1988) Techniques for design and implementation of efficient spatial accessmethods. In: Proceedings of the 14th international conference on very large data bases, pp 360-371.
27. Sen P, Getoor L (2008) Cost-sensitive learning with conditional Markov networks. Data Min Knowl Discov 17(2):136-163.
28. Sismanis Y, Deligiannakis A, Roussopoulos N, Kotidis Y (2002) Dwarf: shrinking the petacube. In: Proceedings of the 2002ACMSIGMOD international conference on management of data, pp 464-475.
29. Tan K, Eng P, OOi B (2001) Efficient progressive skyline computation. In: Proceedings of the 27th international conference on very large data bases, pp 301-310.
30. Tao Y, Xiao X, Pei J (2006) SUBSKY: efficient computation of skylines in subspaces. In: Proceedings of the 22nd international conference on data engineering, pp 65-74.
31. Wang K, Zhou S, Han J (2002) Profit mining: from patterns to actions. In: Proceedings of the 8th international conference on extending database technology, pp 70-87.
32. Wong R, Fu A, Wang K (2003) MPIS: maximal-profit item selection with cross-selling considerations. In: Proceedings of the third IEEE international conference on data mining, pp 371-378.
33. Yang B, Huang H (2009) TOPSIL-Miner: an efficient algorithm for mining Top-K significant itemsets over data streams. Knowledge and information systems.
34. Yao J (2003) Sensitivity analysis for data Mining. In: Proceedings of the 22nd international conference of the North American fuzzy information processing society, pp 272-277.
35. Yuan Y, Lin X, Liu Q, Wang W, Yu J, Zhang Q (2005) Efficient computation of skyline cube. In: Proceedings of the 31th international conference on very large data bases, pp 241-252.
36. Zhang M, Alhajj R (2009) Effectiveness of NAQ-tree as index structure for similarity search in highdimensional metric space. Knowledge and information systems.