메뉴 건너뛰기




Volumn 19, Issue 7, 2008, Pages 865-877

A novel algorithm for mining association rules in Wireless Ad Hoc Sensor Networks

Author keywords

Distributed data mining; Distributed systems; Wireless sensor networks

Indexed keywords

BEHAVIORAL PATTERNS; DATA EXTRACTIONS; DISTRIBUTED DATA MINING; DISTRIBUTED DATUM; DISTRIBUTED SYSTEMS; EXPERIMENTAL STUDIES; FORMAL DEFINITIONS; MINING ASSOCIATION RULES; MINING PROCESS; NOVEL ALGORITHMS; QUALITY-OF-SERVICE; RESOURCE MANAGEMENT PROCESS; SIDE EFFECTS; WIRELESS AD HOC SENSOR NETWORKS; WIRELESS COMMUNICATIONS;

EID: 56349090458     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPDS.2007.70789     Document Type: Article
Times cited : (75)

References (26)
  • 3
    • 33644897598 scopus 로고    scopus 로고
    • Fault-Tolerant Wireless Sensor Network Routing Protocols for the Supervision of Context-Aware Physical Environments
    • A. Boukerche, R.W. Pazzi, and R.B. Araujo, "Fault-Tolerant Wireless Sensor Network Routing Protocols for the Supervision of Context-Aware Physical Environments," J. Parallel and Distributing Computing, vol. 66, no. 4, 2006.
    • (2006) J. Parallel and Distributing Computing , vol.66 , Issue.4
    • Boukerche, A.1    Pazzi, R.W.2    Araujo, R.B.3
  • 4
    • 0027621699 scopus 로고
    • Mining Association Rules between Sets of Items in Large Databases
    • 93, May
    • R. Agrawal, T. Imielinski, and A. Swami, "Mining Association Rules between Sets of Items in Large Databases," Proc. ACM SIGMOD '93, May 1993.
    • (1993) Proc. ACM SIGMOD
    • Agrawal, R.1    Imielinski, T.2    Swami, A.3
  • 6
    • 84976830511 scopus 로고
    • An Effective Hash-Based Algorithm for Mining Association Rules
    • 95, May
    • J.S. Park, M. Chen, and P.S. Yu, "An Effective Hash-Based Algorithm for Mining Association Rules," Proc. ACM SIGMOD '95, May 1995.
    • (1995) Proc. ACM SIGMOD
    • Park, J.S.1    Chen, M.2    Yu, P.S.3
  • 7
    • 0031162961 scopus 로고    scopus 로고
    • Dynamic Itemset Counting and Implication Rules for Market Basket Data
    • 97, May
    • S. Brin, R. Motwani, J.D. Ullman, and S. Tsur, "Dynamic Itemset Counting and Implication Rules for Market Basket Data," Proc. ACM SIGMOD '97, May 1997.
    • (1997) Proc. ACM SIGMOD
    • Brin, S.1    Motwani, R.2    Ullman, J.D.3    Tsur, S.4
  • 9
    • 64349124632 scopus 로고    scopus 로고
    • B. Goethals, http://www.adrem.ua.ac.be/-goethals/software, 2007.
    • (2007)
    • Goethals, B.1
  • 10
    • 64349088881 scopus 로고    scopus 로고
    • research.net/labdata
    • Intel Lab Data, http://berkeley.intel-research.net/labdata/, 2007.
    • (2007) Intel Lab Data
  • 14
    • 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, no. 1, pp. 53-87, 2004.
    • (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
  • 22
    • 33747130666 scopus 로고    scopus 로고
    • Wireless Underground Sensor Networks: Research Challenges
    • I.F. Akyildiz and E.P. Stuntebeck, "Wireless Underground Sensor Networks: Research Challenges," Ad Hoc Networks, vol. 4, no. 6, pp. 669-686, 2006.
    • (2006) Ad Hoc Networks , vol.4 , Issue.6 , pp. 669-686
    • Akyildiz, I.F.1    Stuntebeck, E.P.2
  • 24
    • 64349086941 scopus 로고    scopus 로고
    • http://www.mathworks.com/products/matlab/, 2007.
    • (2007)
  • 25
    • 1442272748 scopus 로고    scopus 로고
    • CT-ITL: Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
    • Y.G. Sucahyo and R.P. Gopalan, "CT-ITL: Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth," Proc. 14th Australasian Database Conf. (ADC), 2003.
    • (2003) Proc. 14th Australasian Database Conf. (ADC)
    • Sucahyo, Y.G.1    Gopalan, R.P.2


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