Abstract

It is very difficult to handle the huge amount of information stored in modern databases. To manage with these databases association rule mining is currently used, which is a costly process that involves a significant amount of time and memory. Therefore, it is necessary to develop an approach to overcome these difficulties. A suitable data structures and algorithms must be developed to effectively perform the item set mining. An index includes all necessary characteristics potentially needed during the mining task; the extraction can be executed with the help of the index, without accessing the database. A database index is a data structure that enhances the speed of information retrieval operations on a database table at very low cost and increased storage space. The use index permits user interaction, in which the user can specify different attributes for item set extraction. Therefore, the extraction can be completed with the use index and without accessing the original database. Index also supports for reusing concept to mine item sets with the use of any support threshold. This paper also focuses on the survey of index support for item set mining which are proposed by various authors.

How to Cite
S B KUMAR, DR.P K SINGHAL, Dr.. A Survey on Index Support for Item Set Mining. Global Journal of Computer Science and Technology, [S.l.], aug. 2011. ISSN 0975-4172. Available at: <https://computerresearch.org/index.php/computer/article/view/773>. Date accessed: 24 jan. 2021.