• Journal of the Korean Data and Information Science Society
• /
• v.16 no.2
• /
• pp.207-216
• /
• 2005

One of the well-studied problems in data mining is the search for association rules. Association rules are useful for determining correlations between attributes of a relation and have applications in marketing, financial and retail sectors. There are three criteria of association rule; support, confidence, lift. The goal of association rule mining is to find all the rules with support and confidence exceeding some user specified thresholds. We can know there is association between two items by the criteria of association rules. But we can not know the degree of association between two items. In this paper we examine the relation between the measures of association and the criteria of association rule for ordinal data.

• 한국데이터정보과학회:학술대회논문집
• /
• 2005.04a
• /
• pp.18-24
• /
• 2005

The methods of data mining are decision tree, association rules, clustering, neural network and so on. Data mining is the method to find useful information for large amounts of data in database. It is used to find hidden knowledge by massive data, unexpectedly pattern, relation to new rule. We analyze Gyeongnam social indicator survey data by 2003 using association rule technique for environment information. Association rules are useful for determining correlations between attributes of a relation and have applications in marketing, financial and retail sectors. We can use association rule outputs in environmental preservation and environmental improvement.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.3
• /
• pp.366-370
• /
• 2003

In this research, we suggest a hybrid intelligent Web recommendation systems based on Web data mining and case-based reasoning (CBR). One of the important research topics in the field of Internet business is blending artificial intelligence (AI) techniques with knowledge discovering in database (KDD) or data mining (DM). Data mining is used as an efficient mechanism in reasoning for association knowledge between goods and customers＇ preference. In the field of data mining, the features, called attributes, are often selected primary for mining the association knowledge between related products. Therefore, most of researches, in the arena of Web data mining, used association rules extraction mechanism. However, association rules extraction mechanism has a potential limitation in flexibility of reasoning. If there are some goods, which were not retrieved by association rules-based reasoning, we can＇t present more information to customer. To overcome this limitation case, we combined CBR with Web data mining. CBR is one of the AI techniques and used in problems for which it is difficult to solve with logical (association) rules. A Web-log data gathered in real-world Web shopping mall was given to illustrate the quality of the proposed hybrid recommendation mechanism. This Web shopping mall deals with remote-controlled plastic models such as remote-controlled car, yacht, airplane, and helicopter. The experimental results showed that our hybrid recommendation mechanism could reflect both association knowledge and implicit human knowledge extracted from cases in Web databases.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.14 no.5
• /
• pp.812-817
• /
• 2011

In this paper, we propose new data association method called the Highest Probability Data Association with Limited Measurement Numbers(HPDA-LIMN) using a Signal Itensity Ordering method applied to tracking in clutter environment. The performance of HPDA-LIMN algorithm is tested in a series of Monte Carlo simulations runs and is compared with the exiting data association method in cluttered environment.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.61
• /
• pp.115-126
• /
• 2000

In General, data mining is defined as the knowledge discovery or extracting hidden necessary information from large databases. Its technique can be applied into decision making, prediction, and information analysis through analyzing of relationship and pattern among data. One of the most important works is to find association rules in data mining. Association Rule is mainly being used in basket analysis. In addition, it has been used in the analysis of web-log and user-pattern. This paper provides the application method in the field of marketing through the analysis of data using association rule as a technique of data mining.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.24 no.63
• /
• pp.23-31
• /
• 2001

Data mining can be either directed or undirected. One way of thinking about it is that we use undirected data mining to recognize relationship in the data and directed data mining to explain those relationships once they have been found. Several data mining techniques have received considerable research attention. In this paper, we propose an algorithm for discovering association rules as directed data mining and applying them to classification. In the first phase, we find frequent closed itemsets and association rules. After this phase, we construct the decision trees using discovered association rules. The algorithm can be applicable to customer relationship management.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.28 no.3
• /
• pp.135-148
• /
• 2003

In this paper we introduce the Internet-based purchase support systems using data mining and case-based reasoning (CBR). Internet Business activity that involves the end user is undergoing a significant revolution. The ability to track users browsing behavior has brought the vendor and end customer's closer than ever before. It is now possible for a vendor to personalize his product message for individual customers at massive scale. Most of former researchers, in this research arena, used data mining techniques to pursue the customer's future behavior and to improve the frequency of repurchase. The area of data mining can be defined as efficiently discovering association rules from large collections of data. However, the basic association rule-based data mining technique was not flexible. If there were no inference rules to track the customer's future behavior, association rule-based data mining systems may not present more information. To resolve this problem, we combined association rule-based data mining with CBR mechanism. CBR is used in reasoning for customer's preference searching and training through the cases. Data mining and CBR-based hybrid purchase support mechanism can reflect both association rule-based logical inference and case-based information reuse. A Web-log data gathered in the real-world Internet shopping mall is given to illustrate the quality of the proposed systems.

• Journal of the Korean Data and Information Science Society
• /
• v.13 no.2
• /
• pp.115-128
• /
• 2002

One of the well-studied problems in data mining is the search for association rules. In this paper we consider the statistical decision making of association threshold in association rule. A chi-squared statistic is used to find minimum association threshold. We calculate the range of the value that two item sets are occurred simultaneously, and find the minimum confidence threshold values.

• Proceedings of the Safety Management and Science Conference
• /
• 2000.11a
• /
• pp.299-306
• /
• 2000

General definition of data mining is the knowledge discovery or is to extract hidden necessary information from large databases. Its technique can be applied into decision making, prediction, and information analysis through analyzing of relationship and pattern among data. One of the most important work is to find association rules in data mining. The objective of this paper is to find customer's trend using association rule from analysis of database and the result can be used as fundamental data for CRM(Customer Relationship Management). This paper uses Apriori algorithm and FoodMart data in order to find association rules.

• The Journal of the Acoustical Society of Korea
• /
• v.40 no.2
• /
• pp.109-120
• /
• 2021

This paper proposes the H∞ norm based data association gate method to apply robustly the data association gate of passive sonar automatic target tracking which is on non-linear targets in dense cluttered environment. For target tracking, data association method selects the measurements within validated gate, which means validated measuring extent, as candidates for the data association. If the extent of the validated gate in the data association is not proper or the data association executes under dense cluttered environment, it is difficult to maintain the robustness of target tracking due to interference of clutter measurements. To resolve this problem, this paper proposes a novel gating method which applies H∞ norm based bisection algorithm combined with 3-σ gate method under Gaussian distribution assumption and tracking error covariance. The proposed method leads to alleviate the interference of clutters and to track the non-linear maneuvering target robustly. Through analytic method and simulation to utilize simulated data of horizontal and vertical bearing measurements, improvement of data association robustness is confirmed contrary to the conventional method.