Please use this identifier to cite or link to this item:
|Title:||DADA: A data cube for dominant relationship analysis|
Dominant relationship analysis
Microeconomic data mining
|Citation:||Li, C.,Ooi, B.C.,Tung, A.K.H.,Wang, S. (2006). DADA: A data cube for dominant relationship analysis. Proceedings of the ACM SIGMOD International Conference on Management of Data : 659-670. ScholarBank@NUS Repository. https://doi.org/10.1145/1142473.1142547|
|Abstract:||The concept of dominance has recently attracted much interest in the context of skyline computation. Given an N-dimensional data set S, a point p is said to dominate q if p is better than q in at least one dimension and equal to or better than it in the remaining dimensions. In this paper, we propose extending the concept of dominance for business analysis from a microeconomic perspective. More specifically, we propose a new form of analysis, called Dominant Relationship Analysis (DRA), which aims to provide insight into the dominant relationships between products and potential buyers. By analyzing such relationships, companies can position their products more effectively while remaining profitable.To support DRA, we propose a novel data cube called DADA (Data Cube for Dominant Relationship Analysis), which captures the dominant relationships between products and customers. Three types of queries called Dominant Relationship Queries (DRQs) are consequently proposed for analysis purposes: 1)Linear Optimization Queries (LOQ), 2)Subspace Analysis Queries (SAQ), and 3)Comparative Dominant Queries (CDQ). Algorithms are designed for efficient computation of DADA and answering the DRQs using DADA. Results of our comprehensive experiments show the effectiveness and efficiency of DADA and its associated query processing strategies. Copyright 2006 ACM.|
|Source Title:||Proceedings of the ACM SIGMOD International Conference on Management of Data|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 20, 2019
checked on Dec 15, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.