• Journal of Information Technology Applications and Management
• /
• 제17권1호
• /
• pp.127-139
• /
• 2010

Customer behavior pattern discovery is the fundament for conducting customer oriented services and the services management. But, the composition, need, interest and experience of customers may be continuously changing, thereof lead to the difficulty in refining a stable description of their consistent behavior pattern. This paper presented a new method for the behavior pattern discovery from a changing collection of customers. It was originally inspired from the swarm intelligence of ant colony. By the adaptive clustering, some typical behavior patterns which reflect the characteristics of related customer clusters can extracted dynamically and adaptively.

• 한국초등과학교육학회지:초등과학교육
• /
• 제23권1호
• /
• pp.61-73
• /
• 2004

본 연구는 다양한 경향성을 발견할 수 있는 과제를 피험자들에게 제시하고, 피험자들이 경향성 지식을 생성하는 과정에서 표상 된 지식의 종류와 사고 유형을 분석하여 경향성 지식의 생성 과정을 알아보고자 하였다. 본 연구의 결과, 경향성 지식의 생성 과정에서 표상 된 지식은 요소, 요소변화, 관련선지식, 예측경향성, 최종 경향성 지식 등 5가지 유형의 과정적 지식이 생성되었다. 그리고 사용된 사고 유형은 `대상인식', '관련지식회상', '요소 또는 요소변화의 탐색', '예측경향성 발견', '예측경향성 확인', 경향성 조합', '경향성 선택' 등 7가지 유형의 사고가 경향성 지식 생성 과정에 관여함을 볼 수 있었다. 또한 경향성 지식 생성과정은 `요소 \$\longrightarrow$요소변화 \$\longrightarrow$(관련선지식 \$\longrightarrow$)예측경향성 생성ㆍ확인 \$\longrightarrow$최종경향성'의 순으로 과정적 지식들이 단계적으로 표상 되어 생성되었으며, 이러한 과정에서 귀납적 추론뿐만 아니라, 귀추적 추론과 연역적 추론도 함께 관여하는 것을 볼 수 있었다.

• Communications for Statistical Applications and Methods
• /
• 제8권1호
• /
• pp.271-279
• /
• 2001

Sequential pattern discovery is one of main interests in web usage mining. the technique of sequential pattern discovery attempts to find inter-session patterns such that the presence of a set of items is followed by another item in a time-ordered set of server sessions. In this paper, a tree-based sequential pattern finding method is proposed in order to discover navigation patterns in server sessions. At each learning process, the suggested method learns about the navigation patterns per server session and summarized into the modified Rymon's tree.

• 정보처리학회논문지D
• /
• 제10D권7호
• /
• pp.1103-1114
• /
• 2003

현재의 이동객체를 기반으로 하는 다양한 시공간 응용환경에서의 서비스 지원 시스템 개발을 위하여 중요한 문제 중의 하나는 방대한 이동객체의 위치 이동 데이터로부터의 의미 있는 지식인 시공간 이동 패턴을 탐사하는 것이다. 이를 위하여 시간적 위상관계, 공간적 위상관계 그리고 시공간적 위상관계에 대한 접근이 지식 탐사를 위하여 고려되어야 한다. 이 논문에서는 효율적인 시공간 이동 패턴 탐사 기법인 MPMine 알고리즘을 제안하였다. 제안한 기법은 시간 제약조건과 공간 제약조건 등을 함께 괴려하며 또한 공간 위상 연산인 contain()을 이용한 공간 개념화를 수행할 수 있다. 제안한 기법은 기존의 일반적인 시간 패턴 탐사 기법과 달리 이동객체 데이터 집합으로부터 위치 및 일반화를 통하여 탐색 공간을 줄일 수 있어 효율적으로 유용한 이동 패턴을 탐사할 수 있다.

• 한국정보시스템학회지:정보시스템연구
• /
• 제3권
• /
• pp.147-169
• /
• 1994

This paper present s a pattern generation scheme from financial charts. The patterns constitute knowledge which consists of patterns as the conditional part and the impact of the pattern as the conclusion part. The patterns in charts are represented in a syntactic approach. If the pattern elements and the impact of patterns are defined, the patterns are synthesized from simple to the more highly credible by evaluating each intermediate pattern from the instances. The overall process is divided into primitive discovery by Genetic Algorithms and pattern synthesis from the discovered primitives by the Syntactic Pattern-based Inductive Learning (SYNPLE) algorithm which we have developed. We have applied the scheme to a chart : the trend lines of stock price in daily base. The scheme can generate very credible patterns from training data sets.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2005년도 Proceedings of ISRS 2005
• /
• pp.454-457
• /
• 2005

Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous studies adopt an Apriori-like candidate set generation-and-test approach. However, candidate set generation is still costly, especially when there exist prolific patterns and/or long patterns. And calendar based on temporal association rules proposes the discovery of association rules along with their temporal patterns in terms of calendar schemas, but this approach is also adopt an Apriori-like candidate set generation. In this paper, we propose an efficient temporal frequent pattern mining using TFP-tree (Temporal Frequent Pattern tree). This approach has three advantages: (1) this method separates many partitions by according to maximum size domain and only scans the transaction once for reducing the I/O cost. (2) This method maintains all of transactions using FP-trees. (3) We only have the FP-trees of I-star pattern and other star pattern nodes only link them step by step for efficient mining and the saving memory. Our performance study shows that the TFP-tree is efficient and scalable for mining, and is about an order of magnitude faster than the Apriori algorithm and also faster than calendar based on temporal frequent pattern mining methods.

• Journal of Multimedia Information System
• /
• 제4권2호
• /
• pp.57-64
• /
• 2017

Numerous software vulnerabilities have been found in the popular operating systems. And recently, robust linear behaviors in software vulnerability discovery process have been noticeably observed among the many popular systems having multi-versions released. Software users need to estimate how much their software systems are risk enough so that they need to take an action before it is too late. Security vulnerabilities are discovered throughout the life of a software system by both the developers, and normal end-users. So far there have been several vulnerability discovery models are proposed to describe the vulnerability discovery pattern for determining readiness for patch release, optimal resource allocations or evaluating the risk of vulnerability exploitation. Here, we apply a linear vulnerability discovery model into Windows operating systems to see the linear discovery trends currently observed often. The applicability of the observation form the paper show that linear discovery model fits very well with aggregate version rather than each version.

• Journal of Information Processing Systems
• /
• 제2권2호
• /
• pp.124-129
• /
• 2006

With the explosive increase in the generation and utilization of spatiotemporal data sets, many research efforts have been focused on the efficient handling of the large volume of spatiotemporal sets. With the remarkable growth of ubiquitous computing technology, mining from the huge volume of spatiotemporal data sets is regarded as a core technology which can provide real world applications with intelligence. In this paper, we propose a 3-tier knowledge discovery framework for spatiotemporal data mining. This framework provides a foundation model not only to define the problem of spatiotemporal knowledge discovery but also to represent new knowledge and its relationships. Using the proposed knowledge discovery framework, we can easily formalize spatiotemporal data mining problems. The representation model is very useful in modeling the basic elements and the relationships between the objects in spatiotemporal data sets, information and knowledge.

• 한국지능정보시스템학회:학술대회논문집
• /
• 한국지능정보시스템학회 2001년도 The Pacific Aisan Confrence On Intelligent Systems 2001
• /
• pp.431-434
• /
• 2001

Knowledge discovery in databases(KDD) is the process for extracting valid, novel, potentially useful and understandable knowledge form real data. There are many academic and industrial activities with new technologies and application areas. Particularly, data mining is the core step in the KDD process, consisting of many algorithms to perform clustering, pattern recognition and rule induction functions. The main goal of these algorithms is prediction and description. Prediction means the assessment of unknown variables. Description is concerned with providing understandable results in a compatible format to human users. We introduce an efficient data mining algorithm considering predictive and descriptive capability. Reasonable pattern is derived from real world data by a revised neural network model and a proposed fuzzy rule extraction technique is applied to obtain understandable knowledge. The proposed neural network model is a hierarchical self-organizing system. The rule base is compatible to decision makers perception because the generated fuzzy rule set reflects the human information process. Results from real world application are analyzed to evaluate the system\`s performance.

• ETRI Journal
• /
• 제32권5호
• /
• pp.676-686
• /
• 2010

Mining sequential patterns is an important research issue in data mining and knowledge discovery with broad applications. However, the existing sequential pattern mining approaches consider only binary frequency values of items in sequences and equal importance/significance values of distinct items. Therefore, they are not applicable to actually represent many real-world scenarios. In this paper, we propose a novel framework for mining high-utility sequential patterns for more real-life applicable information extraction from sequence databases with non-binary frequency values of items in sequences and different importance/significance values for distinct items. Moreover, for mining high-utility sequential patterns, we propose two new algorithms: UtilityLevel is a high-utility sequential pattern mining with a level-wise candidate generation approach, and UtilitySpan is a high-utility sequential pattern mining with a pattern growth approach. Extensive performance analyses show that our algorithms are very efficient and scalable for mining high-utility sequential patterns.