Open Access Open Access  Restricted Access Subscription or Fee Access

Survey on Identifying the Attributes That Improve the Object Visibility

T. Neethu Mohan, Deepa Kanmani, G. Hemalatha

Abstract


The existing top k- retrieval algorithms help the users for searching and retrieving the needed products from the databases. But there is a different view for the problem i.e. how the sellers can identify the user preferred features for a product. The problem is to identify the best attributes so that the product is highly visible to the customers. In this paper, several solutions for the problem are considered. It includes exact and approximation algorithms. The exact algorithm is a maximal frequent item set mining algorithm. This algorithm uses random walk in Dualize and Advance algorithm as its foundation. The approximation algorithms are based on greedy heuristics. Two greedy heuristics are described for solving the problem. This greedy heuristics is a modification of the existing greedy algorithm for the attribute selection. Even though the problem considered is novel, this paper surveys on the above specified algorithms.

Keywords


Data Mining, Knowledge and Data Engineering Tools and Techniques, Marketing, Mining Methods and Algorithms, Retrieval Models

Full Text:

PDF

References


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.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.