• Proceedings of the Korea Information Processing Society Conference
• /
• 2019.05a
• /
• pp.33-35
• /
• 2019

서로 다른 아이템 집합의 연관성을 분석하는 것을 연관규칙분석이라 한다. 대표적인 알고리즘으로 Apriori 알고리즘이 있지만 DB스캔 횟수가 많아질 수 있고 후보 집합 생성으로 인해서 속도가 느려질 수 있다는 단점이 있다. 이를 효율적으로 개선한 FP-Growth 알고리즘을 구현하여 임의의 데이터를 이용하여 알고리즘의 속도에 대해 연구한다.

• The KIPS Transactions:PartD
• /
• v.14D no.5
• /
• pp.483-490
• /
• 2007

Recently mining techniques that analyze the data stream to discover potential information, have been widely studied. However, most of the researches based on the support are concerned with the frequent event, but ignore the infrequent event even if it is crucial. In this paper, we propose SM-AF method discovering association rules to an abnormal event. In considering the window that an abnormal event is sensed, SM-AF method can discover the association rules to the critical event, even if it is occurred infrequently. Also, SM-AF method can discover the significant rare itemsets associated with abnormal event and periodic event itemsets. Through analysis and experiments, we show that SM-AF method is superior to the previous methods of mining association rules.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2023.07a
• /
• pp.207-208
• /
• 2023

다크웹을 통한 마약, 금융거래, 해킹 등 사이버 범죄가 증가하면서 다크웹 상의 범죄 추적을 위한 사이버 수사 필요성이 증대되고 있다. Tor와 같은 다크웹 접속 브라우저는 강력한 익명성을 제공하기 때문에 주로 다크웹 운영상의 취약점 분석, 악성코드를 활용한 함정수사 기법이 실효성 높은 다크웹 수사 기술로 간주된다. 그러나 사이트 개설 및 폐쇄가 빈번하게 발생하는 다크웹의 특성상 최신 범죄 정보를 수집하기 위해서는 방대한 다크웹 정보를 실시간 수집하고, 능동적으로 검색 키워드를 확장할 수 있는 고도화된 크롤러 기술 개발이 필요하다. 본 논문은 다양한 다크웹 사이트 중, 아동 음란물 사이트를 크롤링을 통해 수집하고, 수집된 텍스트의 연관 분석을 통해 검색 키워드를 확장하는 수집 체계를 제안한다.

• The KIPS Transactions:PartD
• /
• v.17D no.1
• /
• pp.1-8
• /
• 2010

Association rule mining techniques enable us to acquire knowledge concerning sales patterns among individual items from voluminous transactional data. Certainly, one of the major purposes of association rule mining is utilizing the acquired knowledge to provide marketing strategies such as catalogue design, cross-selling and shop allocation. However, this requires too much time and high cost to only extract the actionable and profitable knowledge from tremendous numbers of discovered patterns. In currently available literature, a number of interest measures have been devised to accelerate and systematize the process of pattern evaluation. Unfortunately, most of such measures, including support and confidence, are prone to yielding impractical results because they are calculated only from the sales frequencies of items. For instance, traditional measures cannot differentiate between the purchases in a small basket and those in a large shopping cart. Therefore, some adjustment should be made to the size of market baskets because there is a strong possibility that mutually irrelevant items could appear together in a large shopping cart. Contrary to the previous approaches, we attempted to consider market basket's size in calculating interest measures. Because the devised measure assigns different weights to individual purchases according to their basket sizes, we expect that the measure can minimize distortion of results caused by accidental patterns. Additionally, we performed intensive computer simulations under various environments, and we performed real case analyses to analyze the correctness and consistency of the devised measure.

• Journal of the Korean Data and Information Science Society
• /
• v.25 no.4
• /
• pp.857-868
• /
• 2014

Data mining is the representative analysis methodology in the era of big data, and is the process to analyze a massive volume database and summarize it into meaningful information. Association rule technique finds the relationship among several items in huge database using the interestingness measures such as support, confidence, lift, etc. But these interestingness measures cannot be used to establish a causality relationship between antecedent and consequent item sets. Moreover, we can not know association direction by them. This paper propose causally confirmed association thresholds to compensate for these problems, and then check the three conditions of interestingness measures. The comparative studies with basic association thresholds, causal association thresholds, and causally confirmed association thresholds are shown by simulation studies. The results show that causally confirmed association thresholds are better than basic and causal association thresholds.

• The KIPS Transactions:PartD
• /
• v.18D no.6
• /
• pp.423-432
• /
• 2011

In this paper, we introduce XOnto-Apriori algorithm which is an extension of the Onto-Apriori algorithm. The extended algorithm is designed to improve the conventional algorithm's problem of comparing only identifiers of transaction items by reasoning transaction properties of the items which belong in the same category. We show how the mining algorithm works with a smartphone application recommender system based on our extended algorithm to clearly describe the procedures providing personalized recommendations. Further, our simulation results validate our analysis on the algorithm overhead, precision, and recall.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10b
• /
• pp.362-365
• /
• 2006

인터넷 사용자가 급증함에 따라 온톨로지를 이용한 지능형 웹이나 인터넷 사용자에게 개인 맞춤형 서비스를 제공하기 위한 다양한 연구가 진행되고 있다. 대표적인 예로 문맥광고는 인터넷 사용자들이 뉴스나 커뮤니티 사이트에서 콘텐츠를 조회하고, 해당 콘텐츠와 일치하거나 관련성이 높은 제품 또는 서비스 정보를 제공하는 광고기법이다. 그러나 문맥 광고는 사용자에게 다양한 콘텐츠 및 사이트 추천 서비스를 제공하지 못하고 있다. 따라서 다양한 콘텐츠 및 사이트 추천 서비스를 제공하기 위해 본 논문에서는 사용자가 조회한 콘텐츠의 내용을 대표할 수 있는 중요 키워드를 선정하고, 콘텐츠 내에서 추출된 키워드간의 연관성을 분석하여 관련 콘텐츠 및 사이트를 추천하는 방법에 대해 제안한다. 또한 연관키워드리스트 생성방법을 고속연관규칙을 이용하여 처리속도를 줄이고, 사용자가 선호할 만한 다양한 콘텐츠와 관련된 사이트를 제공하는 방법에 대해 제안한다.

• Journal of Practical Agriculture & Fisheries Research
• /
• v.22 no.1
• /
• pp.113-129
• /
• 2020

In this study we examined the topic analysis and correlation analysis by text mining to extract meaningful information or rules from the self introduction letter of freshman at Korea National College of Agriculture and Fisheries in 2020. The analysis items are described in items related to 'academic' and 'in-school activities' during high school. In the text mining results, the keywords of 'academic' items were 'study', 'thought', 'effort', 'problem', 'friend', and the key words of 'in-school activities' were 'activity', 'thought', 'friend', 'club', 'school' in order. As a result of the correlation analysis, the key words of 'thinking', 'studying', 'effort', and 'time' played a central role in the 'academic' item. And the key words of 'in-school activities' were 'thought', 'activity', 'school', 'time', and 'friend'. The results of frequency analysis and association analysis were visualized with word cloud and correlation graphs to make it easier to understand all the results. In the next study, TF-IDF(Term Frequency-Inverse Document Frequency) analysis using 'frequency of keywords' and 'reverse of document frequency' will be performed as a method of extracting key words from a large amount of documents.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10a
• /
• pp.307-309
• /
• 2004

침입탐지시스템에서 발생되는 오 경보는 false positive 와 false negative 로 구분된다. false positive는 실제적인 공격은 아니지만 공격이라고 오인하여 경보를 발생시켜 시스템의 효율성을 떨어뜨리기 때문에 false positive 패턴에 대한 분석이 필요하다. 오 경보 데이터는 시간이 지남에 따라 데이터의 양뿐만 아니라 데이터 패턴의 특성 또한 변하게 된다 따라서 새로운 데이터가 추가될 때마다 오 경보 데이터의 패턴을 분석할 수 있는 도구가 필요하다. 이 논문에서는 오 경보 데이터로부터 false positive 의 패턴을 분석할 수 있는 프레임워크에 대해서 기술한다. 우리의 프레임워크는 시간이 지남에 따라 변하는 데이터의 패턴 특성을 분석할 수 있도록 하기 위해 점진적 연관규칙 기법을 적용한다. 이 프레임워크를 통해서 false positive 패턴 특성의 변화를 효율적으로 관리 할 수 있다.

• The Journal of the Korea Contents Association
• /
• v.8 no.1
• /
• pp.282-289
• /
• 2008

Although there were some technological developments in improving the collaborative filtering, they have yet to fully reflect the actual relation of the items. In this paper, we propose the recommendation system using associative web document classification by word frequency and ${\alpha}$-cut to address the short comings of the collaborative filtering. The proposed method extracts words from web documents through the morpheme analysis and accumulates the weight of term frequency. It makes associative rules and applies the weight of term frequency to its confidence by using Apriori algorithm. And it calculates the similarity among the words using the hypergraph partition. Lastly, it classifies related web document by using ${\alpha}$-cut and calculates similarity by using adjusted cosine similarity. The results show that the proposed method significantly outperforms the existing methods.