Survey on Identifying the Attributes That Improve the Object Visibility
Abstract
Keywords
Full Text:
PDFReferences
D. Gunopulos, R. Khardon, H. Mannila, S. Saluja, H. Toivonen, R.S.Sharm, “Discovering all most specific sentences”, ACM Trans. Database Systems, Vol.28, no.2, pp.140-174, 2003.
C.Li, B.C. Ooi, A.K.H. Tung and S.Wang, “DADA: a Data Cube for Dominant Relationship Analysis,” Proc. ACM SIGMOD Conf., 2006
G. Das, V. Hristidis, N. Kapoor and S. Sudarshan, “Ordering the Attributes of Query Results”, Proc. ACM SIGMOD Conf., 2006.
D. Burdick, M. Calimlim, J. Gehrke, “MAFIA: A Maximal Frequent Item set Algorithm for Transactional Databases.” Proc. Int‟l Conf. Data Eng. (ICDE), 2001
J. Han, J. Wang, Y. Lu and P. Tzvetkov, “Mining top-k frequent closed patterns without minimum support,” Proc. Int‟l Conf. Data Mining (ICDM), 2002.
Muhammed Miah, Gautam Das, Vagelis Hristidis and Heikki Mannila, “Determining attributes to maximize visibility of objects”, IEEE Trans. Knowledge and Data Engineering, Vol. 21, no.7, pp.959-973, 2009.
S. Borzsonyi, D. Kossmann, K. Stocker, “The Skyline Operator.” Proc. Int‟l Conf. Data Eng (ICDE ‟01), 2001.
K. S. Beyer and R. Ramakrishnan, “Bottom-up computation of sparse and iceberg cubes”, In SIGMOD 1999, Proceedings ACM SIGMOD International Conference on Management of Data, Philadelphia, Pennsylvania, USA, pages 359–370,jun.1999.
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.