• 한국음향학회지
• /
• 제38권4호
• /
• pp.415-426
• /
• 2019

본 논문은 연안 군사시설 및 주요 기반시설에 대한 침투세력을 감시하는 수영자 탐지 소나에서의 자동 표적추적 알고리즘을 다루었다. 이를 위해 수영자 탐지 소나에서의 해상실험 데이터를 분석하였고, 클러터 환경에서 자동표적 추적을 위한 트랙평가수단으로서 트랙존재확률 기반의 알고리즘을 적용하여 시스템을 구성하였다. 특히 트랙초기화, 확정, 제거, 합병 등의 트랙관리 알고리즘과 단일표적추적 IPDAF(Integrated Probabilistic Data Association Filter), 다중표적추적 LMIPDAF(Linear Multi-target Integrated Probabilistic Data Association Filter) 등의 표적추적 알고리즘을 제시하였으며, 해상실험 데이터 및 몬테카를로 모의실험 데이터를 이용하여 성능을 분석하였다.

• Journal of the Korean Data and Information Science Society
• /
• 제19권4호
• /
• pp.1269-1279
• /
• 2008

Data mining is the technique to find useful information in huge databases. One of the well-studied problems in data mining is exploration for association rules. An association rule technique finds the relation among each items in massive volume databases by several interestingness measures. An important and useful classification scheme of interestingness measures may be based on user-involvement. This results in two categories - objective and subjective measures. This paper present some relative interestingess measures to compare with degrees of association for two groups. A comparative study with some relative interestingness measures is shown by numerical example. The results show that the relative net confidence is the best relative interestingness measure.

• 로봇학회논문지
• /
• 제4권3호
• /
• pp.169-176
• /
• 2009

Low-cost sensors have been widely used for mobile robot navigation in recent years. However, navigation performance based on low-cost sensors is not good enough to be practically used. Among many navigation techniques, building of an accurate map is a fundamental task for service robots, and mapping with low-cost IR sensors was investigated in this research. The robot's orientation uncertainty was considered for mapping by modifying the Bayesian update formula. Then, the data association scheme was investigated to improve the quality of a built map when the robot's pose uncertainty was large. Six low-cost IR sensors mounted on the robot could not give rich data enough to align the range data by the scan matching method, so a new sample-based method was proposed for data association. The real experiments indicated that the mapping method proposed in this research was able to generate a useful map for navigation.

• 대한가정학회지
• /
• 제43권3호
• /
• pp.1-10
• /
• 2005

The purpose of this study was to investigate the enforcement strategy for Consumer Service marketing of an e-Commerce shopping mall. An e-CRM for a Cosmetic e-Commerce shopping mall, Data Warehousing(DW) component, analysis of data mining of the DW, and web applications and strategies had to developed for marketing of consumer service satisfaction. The major findings were as follows: An RFM analysis was used for consumer classification, which is a fundamental process of e-CRM application. The components of the DW were web sales data and consumer data fields. The visual process of consumer segmentations (superior consumer class) for e-CRM solutions is presented. The association analysis algorithm of data mining to up-selling and cross-selling indicates an association rule. These e-CRM results apply web DB marketing and operating principles to a shopping mall. Therefore, the system applications of e-CRM to Consumer services indicate a marketing strategy for consumer-oriented management.

• 대한산업공학회지
• /
• 제42권4호
• /
• pp.249-255
• /
• 2016

Recently, transaction data is accumulated everywhere very rapidly. Association analysis methods are usually applied to analyze transaction data, but the methods have several problems. For example, these methods can only consider one-way relations among items and cannot reflect domain knowledge into analysis process. In order to overcome defect of association analysis methods, we suggest a transaction data analysis method based on probabilistic graphical model (PGM) in this study. The method we suggest has several advantages as compared with association analysis methods. For example, this method has a high flexibility, and can give a solution to various probability problems regarding the transaction data with relationships among items.

• 정보처리학회논문지D
• /
• 제13D권6호
• /
• pp.765-774
• /
• 2006

연관 규칙 탐사는 데이터베이스를 분석하여 잠재되어 있는 지식을 발견하기 위한 기법으로 스트림 데이터 시스템에서 연관 규칙 탐사에 대한 연구가 활발하게 진행되고 있다. 그러나 대부분의 연구들은 센서에서 수집되는 단일 스트림 데이터에 관한 것이며 다차원 스트림 데이터간의 연관 정보는 간과하고 있다. 본 논문에서는 다차원 스트림 데이터간의 연관 규칙을 탐사할 수 있는 AR-MS 방법을 제안한다. AR-MS 방법은 한 번의 데이터 스캔으로 연관 규칙 탐사에 필요한 요약 정보를 구축함으로써 스트림 데이터의 특성을 반영하며, 자주 발생하지는 않지만 특정 이벤트와 빈번하게 발생하는 의미 있는 희소 항목 집합에 대한 연관 규칙을 탐사할 수 있다. 또한 AR-MS 방법은 구축된 요약 정보를 사용하여 다차원 스트림 데이터간의 최대 빈발 항목 집합에 대한 연관 규칙도 탐사한다. 그리고 다양한 실험을 통하여 제안하는 방법이 기존의 방법들에 비하여 우수함을 확인하였다.

• 한국생물정보학회:학술대회논문집
• /
• 한국생물정보시스템생물학회 2005년도 BIOINFO 2005
• /
• pp.161-164
• /
• 2005

Data mining techniques can be applied to identify patterns of interest in the gene expression data. One goal in mining gene expression data is to determine how the expression of any particular gene might affect the expression of other genes. To find relationships between different genes, association rules have been applied to gene expression data set [1]. A notable limitation of association rule mining method is that only the association in a single profile experiment can be detected. It cannot be used to find rules across different condition profiles or different time point profile experiments. However, with the appearance of time-series microarray data, it became possible to analyze the temporal relationship between genes. In this paper, we analyze the time-series microarray gene expression data to extract the sequential patterns which are similar to the association rules between genes among different time points in the yeast cell cycle. The sequential patterns found in our work can catch the associations between different genes which express or repress at diverse time points. We have applied sequential pattern mining method to time-series microarray gene expression data and discovered a number of sequential patterns from two groups of genes (test, control) and more sequential patterns have been discovered from test group (same CO term group) than from the control group (different GO term group). This result can be a support for the potential of sequential patterns which is capable of catching the biologically meaningful association between genes.

• 한국콘텐츠학회지
• /
• 제13권1호
• /
• pp.43-47
• /
• 2015

• 한국데이터정보과학회:학술대회논문집
• /
• 한국데이터정보과학회 2006년도 PROCEEDINGS OF JOINT CONFERENCEOF KDISS AND KDAS
• /
• pp.241-251
• /
• 2006

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. The methods of data mining are decision tree, association rules, clustering, neural network and so on. We analyze industrial waste database using data mining technique. We use k-means algorithm for clustering and C5.0 algorithm for decision tree and Apriori algorithm for association rule. We can use these analysis outputs for environmental preservation and environmental improvement.

• 한국데이터정보과학회:학술대회논문집
• /
• 한국데이터정보과학회 2003년도 춘계학술대회
• /
• pp.159-170
• /
• 2003

This Paper analyzed simultaneous activities of the time use survey by Korea National Statistical Office to use data mining‘s association rule. The survey of National Statistical Office in 1999 considered general analysis for simultaneous activities. But if we use the association rule, we can found the ratio of particular activities at the same time. And we found the probability that another activities practise if we act one particular activity. Using this association rule of data mining we can do more developed and analytical sociological study.