RISS 학술연구정보서비스

검색

인기 검색어

    다국어 입력

    http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

    변환된 중국어를 복사하여 사용하시면 됩니다.

    예시)
    • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
    • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
    닫기
    KCI등재

    연속발생 데이터를 위한 실시간 데이터 마이닝 기법 = A Real-Time Data Mining for Stream Data Sets

    한글로보기

    https://www.riss.kr/link?id=A45006813

    • 0

      상세조회
    • 0

      다운로드
    서지정보 열기
    • 내보내기
    • 내책장담기
    • 공유하기
      • URL 복사
    • 오류접수
    인용문이 복사되었습니다.

    부가정보

    다국어 초록 (Multilingual Abstract) kakao i 다국어 번역

    A stream data is a data set that is accumulated to the data storage from a data source over time continuously. The size of this data set, in many cases, becomes increasingly large over time. To mine information from this massive data, it takes much resource such as storage, memory and time. These unique characteristics of the stream data make it difficult and expensive to use this large size data accumulated over time. Otherwise, if we use only recent or part of a whole data to mine information or pattern, there can be loss of information, which may be useful. To avoid this problem, we suggest a method that efficiently accumulates information, in the form of rule sets, over time. It takes much smaller storage compared to traditional mining methods. These accumulated rule sets are used as prediction models in the future. Based on theories of ensemble approaches, combination of many prediction models, in the form of systematically merged rule sets in this study, is better than one prediction model in performance. This study uses a customer data set that predicts buying power of customers based on their information. This study tests the performance of the suggested method with the data set alone with general prediction methods and compares performances of them.
    번역하기

    A stream data is a data set that is accumulated to the data storage from a data source over time continuously. The size of this data set, in many cases, becomes increasingly large over time. To mine information from this massive data, it takes much re...

    A stream data is a data set that is accumulated to the data storage from a data source over time continuously. The size of this data set, in many cases, becomes increasingly large over time. To mine information from this massive data, it takes much resource such as storage, memory and time. These unique characteristics of the stream data make it difficult and expensive to use this large size data accumulated over time. Otherwise, if we use only recent or part of a whole data to mine information or pattern, there can be loss of information, which may be useful. To avoid this problem, we suggest a method that efficiently accumulates information, in the form of rule sets, over time. It takes much smaller storage compared to traditional mining methods. These accumulated rule sets are used as prediction models in the future. Based on theories of ensemble approaches, combination of many prediction models, in the form of systematically merged rule sets in this study, is better than one prediction model in performance. This study uses a customer data set that predicts buying power of customers based on their information. This study tests the performance of the suggested method with the data set alone with general prediction methods and compares performances of them.

    더보기

    목차 (Table of Contents)

    • Abstract
    • 1. 서론
    • 2. 이론적 배경
    • 3. 연구모형
    • 4. 구매력 예측 자료에의 적용
    • Abstract
    • 1. 서론
    • 2. 이론적 배경
    • 3. 연구모형
    • 4. 구매력 예측 자료에의 적용
    • 5. 결론 및 시사점
    • 참고문헌
    더보기

    참고문헌 (Reference)

    1 "Space- Efficient On-line Computation of Quantile Summaries" 2001.

    2 "Online Associattion Rule Mining" 145-156, 1999

    3 "Mining sequential patterns" 3-14, 1995

    4 "Mining frequent patterns without candidate generation" 1-12, 2000

    5 "Mining Time-Changing Data Streams KDD" 2001.

    6 G. Hulten, "Mining High-Speed Data Streams" 71-80, 2000

    7 "Mining Frequent Patterns in Data Streams at Multiple Time Granularities,Chapter3" MIT Press 2003.

    8 "Mining Data Streams under Block Evolution" 3 (3): 1-10, 2002

    9 "Mining Concept-Drifting Data Streams Using Ensemble Classifiers" 24-27, 2003

    10 "Maintenance of discovered association rules in large databases:An incremental updating technique" 106-114, 1996

    1 "Space- Efficient On-line Computation of Quantile Summaries" 2001.

    2 "Online Associattion Rule Mining" 145-156, 1999

    3 "Mining sequential patterns" 3-14, 1995

    4 "Mining frequent patterns without candidate generation" 1-12, 2000

    5 "Mining Time-Changing Data Streams KDD" 2001.

    6 G. Hulten, "Mining High-Speed Data Streams" 71-80, 2000

    7 "Mining Frequent Patterns in Data Streams at Multiple Time Granularities,Chapter3" MIT Press 2003.

    8 "Mining Data Streams under Block Evolution" 3 (3): 1-10, 2002

    9 "Mining Concept-Drifting Data Streams Using Ensemble Classifiers" 24-27, 2003

    10 "Maintenance of discovered association rules in large databases:An incremental updating technique" 106-114, 1996

    11 "Incremental Mining of Frequent Patterns Without Candidate Generation or Support Constraint" 2003

    12 "Fast algorithms for mining association rules" 1994.

    13 "Data Mining Concepts and Techniques" Morgan Kaufmann 2001.

    14 "DEMON:Mining and monitoring evolving data" 439-448, 2000

    15 "Clustering Data Streams" 2000.

    16 "CLOSET:An efficient algorithm for mining frequent closed item sets" ACM-SIGMOD International workshop of Data Mining and Knowledge Discovery 11-20, 2000

    17 "CHARM:An efficient algorithm for closed item set mining" 2002.

    18 "BOAT:optimistic decision tree construction" 169-180, 1999

    19 "An efficient algorithm to update large item sets with early pruning" nternational Conference on Knowledge Discovery and Data Mining 287-291, 1999

    더보기

    동일학술지(권/호) 다른 논문

    분석정보

    View

    상세정보조회

    0

    Usage

    원문다운로드

    0

    대출신청

    0

    복사신청

    0

    EDDS신청

    0

    동일 주제 내 활용도 TOP

    더보기

    주제

    연도별 연구동향

    연도별 활용동향

    연관논문

    연구자 네트워크맵

    공동연구자 (7)

    유사연구자 (20) 활용도상위20명

    인용정보 인용지수 설명보기

    학술지 이력

    학술지 이력
    연월일 이력구분 이력상세 등재구분
    2026 평가 재인증평가 신청대상 (재인증)
    2020-01-01 등재 등재학술지 유지 (재인증) KCI등재
    2017-01-01 등재 등재학술지 유지 (계속평가) KCI등재
    2013-01-01 등재 등재학술지 유지 (등재유지) KCI등재
    2010-01-01 등재 등재학술지 유지 (등재유지) KCI등재
    2008-01-01 등재 등재학술지 유지 (등재유지) KCI등재
    2006-01-01 등재 등재학술지 유지 (등재유지) KCI등재
    2004-01-01 등재 등재학술지 유지 (등재유지) KCI등재
    2001-01-01 등재 등재학술지 선정 (등재후보2차) KCI등재
    1998-07-01 등재 등재후보학술지 선정 (신규평가) KCI등재후보
    더보기

    학술지 인용정보

    학술지 인용정보
    기준연도 WOS-KCI 통합IF(2년) KCIF(2년) KCIF(3년)
    2016 0.66 0.66 0.69
    KCIF(4년) KCIF(5년) 중심성지수(3년) 즉시성지수
    0.69 0.66 1.157 0.2
    더보기
    해외이동버튼