Efficient prime-based method for interactive mining of frequent patterns.
Over the past decade, an increasing number of efficient algorithms have been proposed to mine frequent patterns by satisfying the minimum support threshold. Generally, determining an appropriate value for minimum support threshold is extremely difficult. This is because the appropriate value depends...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English English |
| Published: |
Elsevier
2011
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/18467/ http://psasir.upm.edu.my/id/eprint/18467/1/Efficient%20prime.pdf |
| _version_ | 1848843517530472448 |
|---|---|
| author | Mohammad Hossein, Nadimi Shahraki Mustapha, Norwati Sulaiman, Md. Nasir Mamat, Ali |
| author_facet | Mohammad Hossein, Nadimi Shahraki Mustapha, Norwati Sulaiman, Md. Nasir Mamat, Ali |
| author_sort | Mohammad Hossein, Nadimi Shahraki |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | Over the past decade, an increasing number of efficient algorithms have been proposed to mine frequent patterns by satisfying the minimum support threshold. Generally, determining an appropriate value for minimum support threshold is extremely difficult. This is because the appropriate value depends on the type of application and expectation of the user. Moreover, in some real-time applications such as web mining and e-business, finding new correlations between patterns by changing the minimum support threshold is needed. Since rerunning mining algorithms from scratch is very costly and time-consuming, researchers have introduced interactive mining of frequent patterns. Recently, a few efficient interactive mining algorithms have been proposed, which are able to capture the content of transaction database to eliminate possibility of the database rescanning. In this paper, we propose a new method based on prime number and its characteristics mainly for interactive mining of frequent patterns. Our method isolates the mining model from the mining process such that once the mining model is constructed; it can be frequently used by mining process with various minimum support thresholds. During the mining process, the mining algorithm reduces the number of candidate patterns and comparisons by using a new candidate set called candidate head set and several efficient pruning techniques. The experimental results verify the efficiency of our method for interactive mining of frequent patterns. |
| first_indexed | 2025-11-15T08:16:17Z |
| format | Article |
| id | upm-18467 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English English |
| last_indexed | 2025-11-15T08:16:17Z |
| publishDate | 2011 |
| publisher | Elsevier |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-184672015-10-19T23:35:21Z http://psasir.upm.edu.my/id/eprint/18467/ Efficient prime-based method for interactive mining of frequent patterns. Mohammad Hossein, Nadimi Shahraki Mustapha, Norwati Sulaiman, Md. Nasir Mamat, Ali Over the past decade, an increasing number of efficient algorithms have been proposed to mine frequent patterns by satisfying the minimum support threshold. Generally, determining an appropriate value for minimum support threshold is extremely difficult. This is because the appropriate value depends on the type of application and expectation of the user. Moreover, in some real-time applications such as web mining and e-business, finding new correlations between patterns by changing the minimum support threshold is needed. Since rerunning mining algorithms from scratch is very costly and time-consuming, researchers have introduced interactive mining of frequent patterns. Recently, a few efficient interactive mining algorithms have been proposed, which are able to capture the content of transaction database to eliminate possibility of the database rescanning. In this paper, we propose a new method based on prime number and its characteristics mainly for interactive mining of frequent patterns. Our method isolates the mining model from the mining process such that once the mining model is constructed; it can be frequently used by mining process with various minimum support thresholds. During the mining process, the mining algorithm reduces the number of candidate patterns and comparisons by using a new candidate set called candidate head set and several efficient pruning techniques. The experimental results verify the efficiency of our method for interactive mining of frequent patterns. Elsevier 2011 Article PeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/18467/1/Efficient%20prime.pdf Mohammad Hossein, Nadimi Shahraki and Mustapha, Norwati and Sulaiman, Md. Nasir and Mamat, Ali (2011) Efficient prime-based method for interactive mining of frequent patterns. Expert Systems with Applications, 38 (10). 12654 -12670. ISSN 0957-4174 10.1016/j.eswa.2011.04.053 English |
| spellingShingle | Mohammad Hossein, Nadimi Shahraki Mustapha, Norwati Sulaiman, Md. Nasir Mamat, Ali Efficient prime-based method for interactive mining of frequent patterns. |
| title | Efficient prime-based method for interactive mining of frequent patterns. |
| title_full | Efficient prime-based method for interactive mining of frequent patterns. |
| title_fullStr | Efficient prime-based method for interactive mining of frequent patterns. |
| title_full_unstemmed | Efficient prime-based method for interactive mining of frequent patterns. |
| title_short | Efficient prime-based method for interactive mining of frequent patterns. |
| title_sort | efficient prime-based method for interactive mining of frequent patterns. |
| url | http://psasir.upm.edu.my/id/eprint/18467/ http://psasir.upm.edu.my/id/eprint/18467/ http://psasir.upm.edu.my/id/eprint/18467/1/Efficient%20prime.pdf |