메뉴 건너뛰기




Volumn E91-D, Issue 11, 2008, Pages 2578-2588

Handling dynamic weights in weighted frequent pattern mining

Author keywords

Data mining; Dynamic weight; Knowledge discovery; Weighted frequent pattern mining

Indexed keywords

COSTS; SEMANTICS;

EID: 68749107028     PISSN: 09168532     EISSN: 17451361     Source Type: Journal    
DOI: 10.1093/ietisy/e91-d.11.2578     Document Type: Article
Times cited : (18)

References (30)
  • 3
    • 84880087434 scopus 로고    scopus 로고
    • WFIM: Weighted frequent itemset mining with a weight range and a minimum weight
    • USA
    • U. Yun and J.J. Leggett, "WFIM: Weighted frequent itemset mining with a weight range and a minimum weight," Proc. Fourth SIAM Int. Conf. on Data Mining, pp.636-640, USA, 2005.
    • (2005) Proc. Fourth SIAM Int. Conf. on Data Mining , pp. 636-640
    • Yun, U.1    Leggett, J.J.2
  • 5
    • 34250329904 scopus 로고    scopus 로고
    • Efficient mining of weighted interesting patterns with a strong weight and/or support affinity
    • U. Yun, "Efficient mining of weighted interesting patterns with a strong weight and/or support affinity," Inf. Sci., vol.177, pp.3477-3499, 2007.
    • (2007) Inf. Sci , vol.177 , pp. 3477-3499
    • Yun, U.1
  • 9
    • 2442449952 scopus 로고    scopus 로고
    • Mining frequent patterns without candidate generation: A frequent-pattern tree approach
    • 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, vol.8, pp.53-87, 2004.
    • (2004) Data Mining and Knowledge Discovery , vol.8 , pp. 53-87
    • Han, J.1    Pei, J.2    Yin, Y.3    Mao, R.4
  • 10
    • 27644510774 scopus 로고    scopus 로고
    • Fast algorithms for frequent itemset mining using FP-Trees
    • Oct
    • G. Grahne and J. Zhu, "Fast algorithms for frequent itemset mining using FP-Trees," IEEE Trans. Knowl. Data Eng., vol.17, no.10, pp.1347-1362, Oct. 2005.
    • (2005) IEEE Trans. Knowl. Data Eng , vol.17 , Issue.10 , pp. 1347-1362
    • Grahne, G.1    Zhu, J.2
  • 11
    • 34547335088 scopus 로고    scopus 로고
    • Frequent pattern mining: Current status and future directions
    • J. Han, H. Cheng, D. Xin, and X. Yan, "Frequent pattern mining: Current status and future directions," Data Mining and Knowledge Discovery, vol.15, pp.55-86, 2007.
    • (2007) Data Mining and Knowledge Discovery , vol.15 , pp. 55-86
    • Han, J.1    Cheng, H.2    Xin, D.3    Yan, X.4
  • 12
    • 33845565062 scopus 로고    scopus 로고
    • Mining frequent patterns securely in distributed systems
    • Nov
    • J. Wang, T. Fukasawa, S. Urabe, T. Takta, and M. Miyazaki, "Mining frequent patterns securely in distributed systems," IEICE Trans. Inf. & Syst., vol.E89-D, no.11, pp.2739-2747, Nov. 2006.
    • (2006) IEICE Trans. Inf. & Syst , vol.E89-D , Issue.11 , pp. 2739-2747
    • Wang, J.1    Fukasawa, T.2    Urabe, S.3    Takta, T.4    Miyazaki, M.5
  • 14
    • 33750185779 scopus 로고    scopus 로고
    • An integrated efficient solution for computing frequent and top-k elements in data streams
    • A. Metwally, D. Agrawal, and A.E. Abbadi, "An integrated efficient solution for computing frequent and top-k elements in data streams," ACM Trans. Database Systems (TODS), vol.31, no.3, pp.1095-1133, 2006.
    • (2006) ACM Trans. Database Systems (TODS) , vol.31 , Issue.3 , pp. 1095-1133
    • Metwally, A.1    Agrawal, D.2    Abbadi, A.E.3
  • 15
    • 33644920942 scopus 로고    scopus 로고
    • Research issues in data stream association rule mining
    • March
    • N. Jiang and L. Gruenwald, "Research issues in data stream association rule mining," SIGMOD Record, vol.35, no.1, pp.14-19, March 2006.
    • (2006) SIGMOD Record , vol.35 , Issue.1 , pp. 14-19
    • Jiang, N.1    Gruenwald, L.2
  • 16
    • 84878048755 scopus 로고    scopus 로고
    • DSTree: A tree structure for the mining of frequent sets from data streams
    • C.K.-S. Leung and Q.I. Khan, "DSTree: A tree structure for the mining of frequent sets from data streams," Proc. 6th Int. Conf. on Data Mining (ICDM'06), pp.928-932, 2006.
    • (2006) Proc. 6th Int. Conf. on Data Mining (ICDM'06) , pp. 928-932
    • Leung, C.K.-S.1    Khan, Q.I.2
  • 17
    • 35048834898 scopus 로고    scopus 로고
    • An efficient approach for maintaining association rules based on adjusting FP-tree structures
    • J.-L. Koh and S.-F. Shieh, "An efficient approach for maintaining association rules based on adjusting FP-tree structures," Proc. DASFAA'04, pp.417-424, 2004.
    • (2004) Proc. DASFAA'04 , pp. 417-424
    • Koh, J.-L.1    Shieh, S.-F.2
  • 18
    • 33749380544 scopus 로고    scopus 로고
    • A fast algorithm for maintenance of association rules in incremental databases
    • July
    • X. Li, Z.-H. Deng, and S. Tang, "A fast algorithm for maintenance of association rules in incremental databases," Advanced Data Mining and Applications (ADMA 06), vol.4093, pp.56-63, July 2006.
    • (2006) Advanced Data Mining and Applications (ADMA 06) , vol.4093 , pp. 56-63
    • Li, X.1    Deng, Z.-H.2    Tang, S.3
  • 19
    • 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, vol.11, no.3, pp.287-311, 2007.
    • (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
  • 23
    • 85027122197 scopus 로고    scopus 로고
    • UCI machine learning repository. Available from
    • UCI machine learning repository. Available from http://kdd.ics.uci.edu/
  • 24
    • 85027144375 scopus 로고    scopus 로고
    • J. Pisharath, Y. Liu, J. Parhi, W.-K. Liao, A. Choudhary, and G. Memik, NU-MineBench version 2.0 source code and datasets. Available from
    • J. Pisharath, Y. Liu, J. Parhi, W.-K. Liao, A. Choudhary, and G. Memik, NU-MineBench version 2.0 source code and datasets. Available from: http://cucis.ece.northwestern.edu/projects/DMS/MineBench.html
  • 27
    • 36148952566 scopus 로고    scopus 로고
    • Isolated items discarding strategy for discovering high utility itemsets
    • Y.-C. Li, J.-S. Yeh, and C.-C. Chang, "Isolated items discarding strategy for discovering high utility itemsets," Data & Knowledge Engineering, vol.64, pp.198-217, 2008.
    • (2008) Data & Knowledge Engineering , vol.64 , pp. 198-217
    • Li, Y.-C.1    Yeh, J.-S.2    Chang, C.-C.3
  • 28
    • 33846239457 scopus 로고    scopus 로고
    • Mining lossless closed frequent patterns with weight constraints
    • U. Yun, "Mining lossless closed frequent patterns with weight constraints," Knowledge-Based Systems, vol.210, pp.86-97, 2007.
    • (2007) Knowledge-Based Systems , vol.210 , pp. 86-97
    • Yun, U.1
  • 29
    • 0041428173 scopus 로고    scopus 로고
    • Post-mining: Maintenance of association rules by weighting
    • S. Zhang, C. Zhang, and X. Yan, "Post-mining: Maintenance of association rules by weighting," Information Systems, vol.28, pp.691-707, 2003.
    • (2003) Information Systems , vol.28 , pp. 691-707
    • Zhang, S.1    Zhang, C.2    Yan, X.3


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