• Proceedings of the Korea Information Processing Society Conference
• /
• 2017.11a
• /
• pp.817-819
• /
• 2017

최근 스마트 기기를 이용하여 의상을 추천하는 시스템에 대한 연구가 활발하게 진행되고 있다. 하지만 기존 연구들은 의상 판매를 목적으로 하거나, 지속적으로 전문가의 견해를 업데이트 해줘야 하는 번거로움을 가지고 있다. 본 논문에서는 트렌드 고려가 어려운 전문가 추천시스템 위주의 의상 추천 시스템의 단점을 보완하려했다. 콘텐츠 기반 추천 알고리즘과 개개인의 코디에 대한 빈도수 분석을 통해 개개인의 성향을 고려했으며, 계층적 클러스터링 알고리즘을 이용하여 군집화 된 유사 사용자들의 코디들을 토대로 트렌드를 반영했다.

• Journal of Korean Institute of Industrial Engineers
• /
• v.27 no.2
• /
• pp.214-225
• /
• 2001

This research deals with an off-line learning method targeted for systematically constructing negotiation strategies in automated electronic commerce. Single-issue negotiation is assumed. Variants of competitive learning and hierarchical clustering method are devised and applied to extracting negotiation strategies, given historical negotiation data set and tactics. Our research is motivated by the following fact: evidence from both theoretical analysis and observations of human interaction shows that if decision makers have prior knowledge on the behaviors of opponents from negotiation, the overall payoff would increase. Simulation-based experiments convinced us that the proposed method is more effective than human negotiation in terms of the ratio of negotiation settlement and resulting payoff.

• Asia pacific journal of information systems
• /
• v.16 no.3
• /
• pp.49-65
• /
• 2006

This study proposes a model for customer segmentation using the psychological characteristics of Internet banking customers. The model was developed through two phased clustering method, called SONN-HC by integrating self-organizing neural networks (SONN) and hierarchical clustering (HC) method. We applied the SONN-HC method to internet banking customer segmentation and performed an empirical analysis with 845 cases. The results of our empirical analysis show the psychological characteristics of Internet banking customers have significant differences among four clusters of the customers created by SONN-HC. From these results, we found that the psychological characteristics of Internet banking customers had an important role of planning a strategy for customer segmentation in a financial institution.

• Journal of the Korean Society for Library and Information Science
• /
• v.43 no.3
• /
• pp.399-416
• /
• 2009

In this study, clustering methods with related tags were discussed for improving search and exploration in the tag space. The experiments were performed on 10 Delicious tags and the strongly-related tags extracted by each 300 documents, and hierarchical and non-hierarchical clustering methods were carried out based on the tag co-occurrences. To evaluate the experimental results, cluster relevance was measured. Results showed that Ward's method with cosine coefficient, which shows good performance to term clustering, was best performed with consistent clustering tendency. Furthermore, it was analyzed that cluster membership among related tags is based on users' tagging purposes or interest and can disambiguate word sense. Therefore, tag clusters would be helpful for improving search and exploration in the tag space.

• 한국HCI학회:학술대회논문집
• /
• 2006.02b
• /
• pp.252-257
• /
• 2006

기본적으로 모든 소비자들은 조금씩 다르며, 제품은 그 차이를 극대화 시킴으로써 다양한 소비를 촉진하게 된다. 이와 같은 시장 세분화와 포지셔닝 전략은 디자인 경영에 있어 매우 중요한 전략적 단계라 할 수 있으며, 기업의 소비자 분석의 목적이기도 하다. 다차원 척도법은 군집 분석에서와 마찬가지로 자료에 내재된 구조를 찾아내어 자료를 함축적으로 표현하고자 하는 자료축약형 다변량 분석 기법이다. 패턴 분류의 수량화를 이용하는 POSA(Partial Order Scalogram Analysis)는 MSA(Multidimensional Scalogram Analysis)의 구조화된 방법으로 디자인 전략을 수립하는 단계에서 소비자의 성향을 보다 세분화할 수 있다. 본 논문에서는 디자인 리서치 단계에 POSA 방법론을 적용하였을 때 소비자 유형 분류가 가능하다고 보고, 창의적 디자인 컨셉의 도출에 어느 정도 역할을 하는지 알아보고자 함을 목적으로 하였다. 본 연구에서는 부분적 계층 분석법인 POSA 분석방법을 통하여 사용자의 계층을 세분화하는 방법을 고안하고, 이를 분석함으로써 소비자의 유형을 분류하여 디자인 포지셔닝과 방향을 제시하는 방법론을 제안하고자 하였다. 이를 위하여 설문조사를 통하여 POSA 기법을 이용한 소비자 유형 분류 방법이 고안되었고, 이를 기반으로 모바일 기기를 위한 프로젝트에 실제 디자인 사례로 적용되었으며, 이러한 소비자 유형 분석을 통하여 타겟 유저의 시나리오 작성 단계에서 창의적 발상을 지원한다는 점을 발견할 수 있었다.

• Journal of KIISE:Databases
• /
• v.31 no.1
• /
• pp.13-22
• /
• 2004

With the proliferation of multimedia data, there is an increasing need to support the indexing and retrieval of high-dimensional image data. Although there have been many efforts, the performance of existing multidimensional indexing methods is not satisfactory in high dimensions. Thus the dimensionality reduction and the approximate solution methods were tried to deal with the so-called dimensionality curse. But these methods are inevitably accompanied by the loss of precision of query results. Therefore, recently, the vector approximation-based methods such as the VA- file and the LPC-file were developed to preserve the precision of query results. However, the performance of the vector approximation-based methods depend largely on the size of the approximation file and they lose the advantages of the multidimensional indexing methods that prune much search space. In this paper, we propose a new index structure called the GC-tree for efficient similarity search in image databases. The GC-tree is based on a special subspace partitioning strategy which is optimized for clustered high-dimensional images. It adaptively partitions the data space based on a density function and dynamically constructs an index structure. The resultant index structure adapts well to the strongly clustered distribution of high-dimensional images.

• The Journal of Bigdata
• /
• v.6 no.2
• /
• pp.29-38
• /
• 2021

Deviation of route in aviation safety management is a dangerous factor that can lead to serious accidents. In this study, the anomaly score is calculated by classifying the tracks through clustering and calculating the distance from the cluster center. The study was conducted by extracting tracks within 100 km of the airport from the ADS-B track data received for one year. The wake was vectorized using linear interpolation. Latitude, longitude, and altitude 3D coordinates were used. Through PCA, the dimension was reduced to an axis representing more than 90% of the overall data distribution, and k-means clustering, hierarchical clustering, and PAM techniques were applied. The number of clusters was selected using the silhouette measure, and an abnormality score was calculated by calculating the distance from the cluster center. In this study, we compare the number of clusters for each cluster technique, and evaluate the clustering result through the silhouette measure.

• Journal of the Korean Data and Information Science Society
• /
• v.20 no.2
• /
• pp.329-338
• /
• 2009

The importance performance analysis is a simple and condensed analytic method for decision making based on the level of performance or satisfaction. Many researches already have witnessed usefulness of the importance performance analysis, but it also has some drawbacks from the statistical points of view. In this article, some additional techniques dealing the importance performance analysis are introduced and it is shown that these techniques would turn out to be very informative. The importance performance analysis uses the arithmetic average as the main statistic, but by the use of the median, the frequency and the cluster analysis it is shown that the importance performance analysis can be carried out with more crucial information. In addtion to that, it is demonstrated that the combination of the analytic hierarchy process and importance performance analysis could enable more reliable decision making.

• Smart Media Journal
• /
• v.10 no.3
• /
• pp.23-30
• /
• 2021

Although the manufacturing time series data clustering technique is an important grouping solution in the field of detecting and improving manufacturing large data-based equipment and process defects, it has a disadvantage of low accuracy when applying the existing static data target clustering technique to time series data. In this paper, an evolutionary computation-based time series cluster analysis approach is presented to improve the coherence of existing clustering techniques. To this end, first, the image shape resulting from the manufacturing process is converted into one-dimensional time series data using linear scanning, and the optimal sub-clusters for hierarchical cluster analysis and split cluster analysis are derived based on the Pearson distance metric as the target of the transformation data. Finally, by using a genetic algorithm, an optimal cluster combination with minimal similarity is derived for the two cluster analysis results. And the performance superiority of the proposed clustering is verified by comparing the performance with the existing clustering technique for the actual manufacturing process image.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04b
• /
• pp.688-690
• /
• 2004

최근 전자화된 문서 영상을 효율적으로 관리하고 검색하기 위한 문서구조분석 방법과 문서의 자동 분류에 관한 많은 연구가 발표되고 있다. 본 논문에서는 NMF(non-negative matrix factorization) 알고리즘을 사용하여 폰트를 자동으로 분류하는 방법을 제안한다. 제안된 방법은 폰트의 구분 특징들이 공간적으로 국부성을 가지는 부분으로 표현될 수 있다는 가정을 바탕으로, 전체의 폰트 이미지들로부터 각 폰트들의 구분 특징인 부분을 학습하고, 학습된 부분들을 특징으로 사용하여 폰트를 분류하는 방법이다. 학습된 폰트의 특징들은 계층적 군집화 알고리즘을 이용하여 템플릿을 생성하고, 테스트 패턴을 분류하기 위하여 템플릿 패턴과의 EMD(earth mover's distance)를 사용한다. 실험결과에서 폰트 이미지들의 공간적으로 국부적인 특징들이 조사되고, 그 특징들의 폰트 식별을 위한 적절성을 보였다. 제안된 방법이 기존의 문자인식. 문서 검색 시스템들의 전처리기로 사용되면. 그 시스템들의 성능을 향상시킬 것으로 기대된다.