Design of Search Engine Considering Top k High Utility Item Set (HUI) Mining and Defining the Recommendation and Point of Interest (POI)
Abstract
Full Text:
PDFReferences
V. S. Tseng, C. Wu, P. Fournier-Viger, and P. S. Yu, Efficient algorithms
for mining the concise and lossless representation of high utility itemsets,
IEEE Trans. Knowl. Data Eng., vol. 27, no. 3, pp. 726739, Mar. 1, 2015.
Vincent S. Tseng, Bai-En Shie, Cheng-Wei Wu, and Philip S. Yu,
Efficient Algorithms for Mining High Utility Itemsets from Transactional
Databases IEEE Trans. Knowl. Data Eng., VOL. 25, 2013.
J. Liu, K. Wang, and B. Fung, Direct discovery of high utility itemsets
without candidate generation, in Proc. IEEE Int. Conf. Data Mining, 2012,
pp. 984989.
CR.Nandhini, Dr.N.Suguna Shrewd Technique for Mining High Utility
Item set via TKU and TKO Algorithm, International Journal of Computer
Science and Information Technologies, Vol. 6, 2015.
U. Yun and J. Kim, A fast perturbation algorithm using tree structure for
privacy preserving utility mining, Expert Syst. Appl., vol. 42, no. 3, pp.
, 2015.
R. Agrawal and R. Srikant, Fast algorithms for mining association rules,
in Proc. Int. Conf. Very Large Data Bases, 1994, pp. 487499.
C. Ahmed, S. Tanbeer, B. Jeong, and Y. Lee, Efficient tree structures for
high-utility pattern mining in incremental databases, IEEE Trans. Knowl.
Data Eng., vol. 21, no. 12, pp. 17081721, Dec.2009.
Refbacks
- There are currently no refbacks.
Copyright © IJETT, International Journal on Emerging Trends in Technology