메뉴 건너뛰기




Volumn 181, Issue 21, 2011, Pages 4878-4894

A framework for mining interesting high utility patterns with a strong frequency affinity

Author keywords

Data mining; Frequency affinity; High utility pattern mining; Interesting patterns; Knowledge discovery

Indexed keywords

DATA STREAM; DATABASE SCANS; FREQUENCY AFFINITY; INTERESTING PATTERNS; MINING ALGORITHMS; NOVEL ALGORITHM; PATTERN MINING; PERFORMANCE ANALYSIS; REAL-TIME DATA PROCESSING; RESEARCH ISSUES; RUNTIMES; SINGLE-PASS MINING; TREE STRUCTURES; TREE-BASED;

EID: 80051549279     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2011.05.012     Document Type: Article
Times cited : (51)

References (47)
  • 5
    • 67849118591 scopus 로고    scopus 로고
    • An algorithm to mine general association rules from tabular data
    • S. Ayubi, M.K. Muyeba, A. Baraani, and J. Keane An algorithm to mine general association rules from tabular data Information Sciences 179 2009 3520 3539
    • (2009) Information Sciences , vol.179 , pp. 3520-3539
    • Ayubi, S.1    Muyeba, M.K.2    Baraani, A.3    Keane, J.4
  • 8
    • 4544293405 scopus 로고    scopus 로고
    • Mining frequent itemsets without support threshold: With and without item constraint
    • Y.-L. Cheung, and A.W.-C. Fu Mining frequent itemsets without support threshold: with and without item constraint IEEE Transactions on Knowledge and Data Engineering 16 9 2004 1052 1069
    • (2004) IEEE Transactions on Knowledge and Data Engineering , vol.16 , Issue.9 , pp. 1052-1069
    • Cheung, Y.-L.1    Fu, A.W.-C.2
  • 9
    • 43849093462 scopus 로고    scopus 로고
    • An efficient algorithm for mining temporal high utility itemsets from data streams
    • DOI 10.1016/j.jss.2007.07.026, PII S0164121207001859
    • C.-J. Chu, V.S. Tseng, and T. Liang An efficient algorithm for mining temporal high utility itemsets from data streams Journal of Systems and Software 81 7 2008 1105 1117 (Pubitemid 351697961)
    • (2008) Journal of Systems and Software , vol.81 , Issue.7 , pp. 1105-1117
    • Chu, C.-J.1    Tseng, V.S.2    Liang, T.3
  • 10
    • 34047267825 scopus 로고    scopus 로고
    • BitTableFI: An efficient mining frequent itemsets algorithm
    • DOI 10.1016/j.knosys.2006.08.005, PII S0950705106001493
    • J. Dong, and M. Han BitTableFI: an efficient mining frequent itemsets algorithm Knowledge-Based Systems 20 2007 329 335 (Pubitemid 46551693)
    • (2007) Knowledge-Based Systems , vol.20 , Issue.4 , pp. 329-335
    • Dong, J.1    Han, M.2
  • 11
    • 70349745711 scopus 로고    scopus 로고
    • RMAIN: Association rules maintenance without reruns through data
    • D. Dudek RMAIN: association rules maintenance without reruns through data Information Sciences 179 2009 4123 4139
    • (2009) Information Sciences , vol.179 , pp. 4123-4139
    • Dudek, D.1
  • 14
    • 27644510774 scopus 로고    scopus 로고
    • Fast algorithms for frequent itemset mining using FP-trees
    • DOI 10.1109/TKDE.2005.166
    • G. Grahne, and J. Zhu Fast algorithms for frequent itemset mining using FP-trees IEEE Transactions on Knowledge and Data Engineering 17 10 2005 1347 1362 (Pubitemid 41560422)
    • (2005) IEEE Transactions on Knowledge and Data Engineering , vol.17 , Issue.10 , pp. 1347-1362
    • Grahne, G.1    Zhu, J.2
  • 15
    • 34547335088 scopus 로고    scopus 로고
    • Frequent pattern mining: Current status and future directions
    • DOI 10.1007/s10618-006-0059-1, 10th Anniversary Issue
    • J. Han, H. Cheng, D. Xin, and X. Yan Frequent pattern mining: current status and future directions Data Mining and Knowledge Discovery 15 2007 55 86 (Pubitemid 47142811)
    • (2007) Data Mining and Knowledge Discovery , vol.15 , Issue.1 , pp. 55-86
    • Han, J.1    Cheng, H.2    Xin, D.3    Yan, X.4
  • 16
    • 2442449952 scopus 로고    scopus 로고
    • Mining frequent patterns without candidate generation: A frequent-pattern tree approach
    • DOI 10.1023/B:DAMI.0000005258.31418.83
    • J. Han, J. Pei, Y. Yin, and R. Mao Mining frequent patterns without candidate generation: a frequent-pattern tree approach Data Mining and Knowledge Discovery 8 2004 53 87 (Pubitemid 39019971)
    • (2004) Data Mining and Knowledge Discovery , vol.8 , Issue.1 , pp. 53-87
    • Han, J.1    Pei, J.2    Yin, Y.3    Mao, R.4
  • 17
    • 77957681813 scopus 로고    scopus 로고
    • Finding top-k elements in data streams
    • N. Homem, and J.P. Carvalho Finding top-k elements in data streams Information Sciences 180 2010 4958 4974
    • (2010) Information Sciences , vol.180 , pp. 4958-4974
    • Homem, N.1    Carvalho, J.P.2
  • 18
    • 33644920942 scopus 로고    scopus 로고
    • Research issues in data stream association rule mining
    • N. Jiang, and L. Gruenwald Research issues in data stream association rule mining ACM SIGMOD Record 35 1 2006 14 19 (Pubitemid 43383843)
    • (2006) SIGMOD Record , vol.35 , Issue.1 , pp. 14-19
    • Jiang, N.1    Gruenwald, L.2
  • 19
    • 7444228742 scopus 로고    scopus 로고
    • CCMine: Efficient Mining of Confidence-Closed Correlated Patterns
    • Advances in Knowledge Discovery and Data Mining
    • W.-Y. Kim, Y.-K. Lee, J. Han, CCMine: efficient mining of confidence-closed correlated patterns, in: Proceedings of the 8th PAKDD, 2004, pp. 569-579. (Pubitemid 38824943)
    • (2004) Lecture Notes in Computer Science , Issue.3056 , pp. 569-579
    • Kim, W.-Y.1    Lee, Y.-K.2    Han, J.3
  • 22
    • 34147173382 scopus 로고    scopus 로고
    • CanTree: A canonical-order tree for incremental frequent-pattern mining
    • C.K.-S. Leung, Q.I. Khan, Z. Li, and T. Hoque CanTree: a canonical-order tree for incremental frequent-pattern mining Knowledge and Information Systems 11 3 2007 287 311
    • (2007) Knowledge and Information Systems , vol.11 , Issue.3 , pp. 287-311
    • Leung, C.K.-S.1    Khan, Q.I.2    Li, Z.3    Hoque, T.4
  • 24
    • 78049238133 scopus 로고    scopus 로고
    • Novel alarm correlation analysis system based on association rules mining in telecommunication networks
    • T. Li, and X. Li Novel alarm correlation analysis system based on association rules mining in telecommunication networks Information Sciences 180 2010 2960 2978
    • (2010) Information Sciences , vol.180 , pp. 2960-2978
    • Li, T.1    Li, X.2
  • 25
    • 36148952566 scopus 로고    scopus 로고
    • Isolated items discarding strategy for discovering high utility itemsets
    • DOI 10.1016/j.datak.2007.06.009, PII S0169023X07001218, Fourth International Conference on Business Process Management (BPM 2006) Four selected and extended papers
    • Y.-C. Li, J.-S. Yeh, and C.-C. Chang Isolated items discarding strategy for discovering high utility itemsets Data and Knowledge Engineering 64 2008 198 217 (Pubitemid 350103608)
    • (2008) Data and Knowledge Engineering , vol.64 , Issue.1 , pp. 198-217
    • Li, Y.-C.1    Yeh, J.-S.2    Chang, C.-C.3
  • 28
    • 58249110789 scopus 로고    scopus 로고
    • Top-down mining of frequent closed patterns from very high dimensional data
    • H. Liu, X. Wang, J. He, J. Han, D. Xin, and Z. Shao Top-down mining of frequent closed patterns from very high dimensional data Information Sciences 179 2009 899 924
    • (2009) Information Sciences , vol.179 , pp. 899-924
    • Liu, H.1    Wang, X.2    He, J.3    Han, J.4    Xin, D.5    Shao, Z.6
  • 29
    • 33750185779 scopus 로고    scopus 로고
    • An integrated efficient solution for computing frequent and top-k elements in data streams
    • DOI 10.1145/1166074.1166084
    • A. Metwally, D. Agrawal, and A.E. Abbadi An integrated efficient solution for computing frequent and top-k elements in data streams ACM Transactions on Database Systems (TODS) 31 3 2006 1095 1133 (Pubitemid 44600833)
    • (2006) ACM Transactions on Database Systems , vol.31 , Issue.3 , pp. 1095-1133
    • Metwally, A.1    Agrawal, D.2    El Abbadi, A.3
  • 33
    • 57649183681 scopus 로고    scopus 로고
    • Efficient single-pass frequent pattern mining using a prefix-tree
    • S.K. Tanbeer, C.F. Ahmed, B.-S. Jeong, and Y.-K. Lee Efficient single-pass frequent pattern mining using a prefix-tree Information Sciences 179 5 2009 559 583
    • (2009) Information Sciences , vol.179 , Issue.5 , pp. 559-583
    • Tanbeer, S.K.1    Ahmed, C.F.2    Jeong, B.-S.3    Lee, Y.-K.4
  • 35
    • 62249183038 scopus 로고    scopus 로고
    • FIUT: A new method for mining frequent itemsets
    • Y.-J. Tsay, T.-J. Hsu, and J.-R. Yu FIUT: a new method for mining frequent itemsets Information Sciences 179 2009 1724 1737
    • (2009) Information Sciences , vol.179 , pp. 1724-1737
    • Tsay, Y.-J.1    Hsu, T.-J.2    Yu, J.-R.3
  • 36
    • 77956392733 scopus 로고    scopus 로고
    • Toward boosting distributed association rule mining by data de-clustering
    • F.S.C. Tseng, Y.-H. Kuo, and Y.-M. Huang Toward boosting distributed association rule mining by data de-clustering Information Sciences 180 2010 4263 4289
    • (2010) Information Sciences , vol.180 , pp. 4263-4289
    • Tseng, F.S.C.1    Kuo, Y.-H.2    Huang, Y.-M.3
  • 37
    • 67149088596 scopus 로고    scopus 로고
    • Improving generalization of fuzzy if-then rules by maximizing fuzzy entropy
    • X.Z. Wang, and C.R. Dong Improving generalization of fuzzy if-then rules by maximizing fuzzy entropy IEEE Transactions on Fuzzy Systems 17 3 2009 556 567
    • (2009) IEEE Transactions on Fuzzy Systems , vol.17 , Issue.3 , pp. 556-567
    • Wang, X.Z.1    Dong, C.R.2
  • 38
  • 39
    • 45649085354 scopus 로고    scopus 로고
    • Induction of multiple fuzzy decision trees based on rough set technique
    • X.Z. Wang, J.H. Zhai, and S.X. Lu Induction of multiple fuzzy decision trees based on rough set technique Information Sciences 178 16 2008 3188 3202
    • (2008) Information Sciences , vol.178 , Issue.16 , pp. 3188-3202
    • Wang, X.Z.1    Zhai, J.H.2    Lu, S.X.3
  • 41
    • 33749250911 scopus 로고    scopus 로고
    • Mining itemset utilities from transaction databases
    • DOI 10.1016/j.datak.2005.10.004, PII S0169023X05001643
    • H. Yao, and H.J. Hamilton Mining itemset utilities from transaction databases Data and Knowledge Engineering 59 2006 603 626 (Pubitemid 44485252)
    • (2006) Data and Knowledge Engineering , vol.59 , Issue.3 SPEC. ISS. , pp. 603-626
    • Yao, H.1    Hamilton, H.J.2
  • 43
    • 11844277111 scopus 로고    scopus 로고
    • Mining interesting sequential patterns for intelligent systems
    • DOI 10.1002/int.20054
    • S.-J. Yen Mining interesting sequential patterns for intelligent systems International Journal of Intelligent Systems 20 2005 73 87 (Pubitemid 40086235)
    • (2005) International Journal of Intelligent Systems , vol.20 , Issue.1 , pp. 73-87
    • Yen, S.-J.1
  • 44
    • 34250203899 scopus 로고    scopus 로고
    • WIS: Weighted interesting sequential pattern mining with a similar level of support and/or weight
    • U. Yun WIS: weighted interesting sequential pattern mining with a similar level of support and/or weight ETRI Journal 29 3 2007 336 352 (Pubitemid 46905704)
    • (2007) ETRI Journal , vol.29 , Issue.3 , pp. 336-352
    • Yun, U.1
  • 45
    • 34250329904 scopus 로고    scopus 로고
    • Efficient mining of weighted interesting patterns with a strong weight and/or support affinity
    • DOI 10.1016/j.ins.2007.03.018, PII S002002550700148X
    • U. Yun Efficient mining of weighted interesting patterns with a strong weight and/or support affinity Information Sciences 177 2007 3477 3499 (Pubitemid 46920531)
    • (2007) Information Sciences , vol.177 , Issue.17 , pp. 3477-3499
    • Yun, U.1
  • 46
    • 33846239457 scopus 로고    scopus 로고
    • Mining lossless closed frequent patterns with weight constraints
    • DOI 10.1016/j.knosys.2006.07.007, PII S0950705106001262
    • U. Yun Mining lossless closed frequent patterns with weight constraints Knowledge-Based Systems 20 2007 86 97 (Pubitemid 46108525)
    • (2007) Knowledge-Based Systems , vol.20 , Issue.1 , pp. 86-97
    • Yun, U.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.