• Title/Summary/Keyword: unsupervised analysis

Search Result 310, Processing Time 0.026 seconds

Implementation of an Artificial Odour Recognition System with Unsupervised Clustering Methods (Unsupervised clustering 방법을 갖는 인공 냄새인식 시스템의 구현)

  • Choi, Chan-Seok;Kim, Jeong-Do;Byun, Hyung-Gi
    • Journal of Sensor Science and Technology
    • /
    • v.10 no.6
    • /
    • pp.310-316
    • /
    • 2001
  • We have been designed and constructed an artificial odour recognition system(electronic nose system) using metal oxide type sensor array for recognizing and analyzing various odours. We proposed an unsupervised clustering method based on Euclidean distances in order for human observer to examine easily multi-dimensional data, which has been measured from an array of sensors. This is a combination of Principal Components Analysis(PCA) used as a starting point for Sammom Mapping Method(SMM). No prior assumptions are made of the classes in which odour belong, and the error due to dimensional reduction at the PCA can be minimized without the disadvantages of rotation of clusters when the order of data sets in a data base was changed in the SMM. An artificial odour recognition system with the proposed unsupervised clustering method was applied to assessment of odour differences of Volatile Organic Compounds(VOCs) and Korean whiskies respectively, and demonstrated the best performances throughout the experimental trails.

  • PDF

Partial Discharge Data Analysis with Unsupervised Classification (무감독분류 기법에 의한 부분방전 데이터 분석)

  • Cho, Kyungsoon;Hong, Seonhack
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.14 no.4
    • /
    • pp.9-16
    • /
    • 2018
  • This study described partial discharge(PD) distribution analysis between the XLPE(Cross-Linked PolyEthylene)and EPDM(Ethylene Propylene Diene Monomer) interface with unsupervised classification. The ${\phi}-q-n$ patterns were analyzed using phase resolved partial discharge(PRPD). K-means cluster analysis forms a cluster based on similarities and distances among scattered individuals, and analyzes the characteristics of the formed clusters, dividing the multivariate data into several groups according to the similarity of each characteristic, Is a statistical analysis that makes it easier to navigate. It was confirmed that the phase angle of the cluster with the maximum discharge charge was concentrated around $0^{\circ}$ and $180^{\circ}$ at 30 kV after the initial phase distribution localized around $90^{\circ}$ and $300^{\circ}$ expanded to the whole phase angle according to the voltage rise. The Euclidean distance between the center of gravity and the discharge charge in the ${\Phi}-q$ cluster increased with increasing applied voltage.

Anomaly Detection in Sensor Data

  • Kim, Jong-Min;Baik, Jaiwook
    • Journal of Applied Reliability
    • /
    • v.18 no.1
    • /
    • pp.20-32
    • /
    • 2018
  • Purpose: The purpose of this study is to set up an anomaly detection criteria for sensor data coming from a motorcycle. Methods: Five sensor values for accelerator pedal, engine rpm, transmission rpm, gear and speed are obtained every 0.02 second from a motorcycle. Exploratory data analysis is used to find any pattern in the data. Traditional process control methods such as X control chart and time series models are fitted to find any anomaly behavior in the data. Finally unsupervised learning algorithm such as k-means clustering is used to find any anomaly spot in the sensor data. Results: According to exploratory data analysis, the distribution of accelerator pedal sensor values is very much skewed to the left. The motorcycle seemed to have been driven in a city at speed less than 45 kilometers per hour. Traditional process control charts such as X control chart fail due to severe autocorrelation in each sensor data. However, ARIMA model found three abnormal points where they are beyond 2 sigma limits in the control chart. We applied a copula based Markov chain to perform statistical process control for correlated observations. Copula based Markov model found anomaly behavior in the similar places as ARIMA model. In an unsupervised learning algorithm, large sensor values get subdivided into two, three, and four disjoint regions. So extreme sensor values are the ones that need to be tracked down for any sign of anomaly behavior in the sensor values. Conclusion: Exploratory data analysis is useful to find any pattern in the sensor data. Process control chart using ARIMA and Joe's copula based Markov model also give warnings near similar places in the data. Unsupervised learning algorithm shows us that the extreme sensor values are the ones that need to be tracked down for any sign of anomaly behavior.

Audio-Visual Content Analysis Based Clustering for Unsupervised Debate Indexing (비교사 토론 인덱싱을 위한 시청각 콘텐츠 분석 기반 클러스터링)

  • Keum, Ji-Soo;Lee, Hyon-Soo
    • The Journal of the Acoustical Society of Korea
    • /
    • v.27 no.5
    • /
    • pp.244-251
    • /
    • 2008
  • In this research, we propose an unsupervised debate indexing method using audio and visual information. The proposed method combines clustering results of speech by BIC and visual by distance function. The combination of audio-visual information reduces the problem of individual use of speech and visual information. Also, an effective content based analysis is possible. We have performed various experiments to evaluate the proposed method according to use of audio-visual information for five types of debate data. From experimental results, we found that the effect of audio-visual integration outperforms individual use of speech and visual information for debate indexing.

A study about CS Unplugged using Unsupervised Learning (비지도 학습을 위한 언플러그드 활동에 대한 연구)

  • Jun, Bungwoo;Shin, Seungki
    • 한국정보교육학회:학술대회논문집
    • /
    • 2021.08a
    • /
    • pp.175-179
    • /
    • 2021
  • Computer Science Unplugged activities are activities to learn about computer science through learning tools other than programming programs. Existing unplugged activities focus on the procedural thinking process and focus on guiding the thinking process through play. There is a lack of research on unsupervised learning, which plays an important role in machine learning, which has recently attracted attention. In this study, we designed and conducted an unplugged activities for unsupervised learning that analyzes data using video media familiar to elementary school students. The results on the effectiveness of the class were analyzed using the bebras challenge. As a result of analyzing the scores of the pre-test and post-test, it was confirmed that the students' computational thinking and problem-solving ability improved.

  • PDF

Multiple Texture Image Recognition with Unsupervised Block-based Clustering (비교사 블록-기반 군집에 의한 다중 텍스쳐 영상 인식)

  • Lee, Woo-Beom;Kim, Wook-Hyun
    • The KIPS Transactions:PartB
    • /
    • v.9B no.3
    • /
    • pp.327-336
    • /
    • 2002
  • Texture analysis is an important technique in many image understanding areas, such as perception of surface, object, shape and depth. But the previous works are intend to the issue of only texture segment, that is not capable of acquiring recognition information. No unsupervised method is basased on the recognition of texture in image. we propose a novel approach for efficient texture image analysis that uses unsupervised learning schemes for the texture recognition. The self-organization neural network for multiple texture image identification is based on block-based clustering and merging. The texture features used are the angle and magnitude in orientation-field that might be different from the sample textures. In order to show the performance of the proposed system, After we have attempted to build a various texture images. The final segmentation is achieved by using efficient edge detection algorithm applying to block-based dilation. The experimental results show that the performance of the system Is very successful.

A Design of Cassifier Using Mudular Neural Networks with Unsupervised Learning (비지도 학습 방법을 적용한 모듈화 신경망 기반의 패턴 분류기 설계)

  • 최종원;오경환
    • Korean Journal of Cognitive Science
    • /
    • v.10 no.1
    • /
    • pp.13-24
    • /
    • 1999
  • In this paper, we propose a classifier based on modular networks using an unsupervised learning method. The structure of each module is designed through stochastic analysis of input data and each module classifier data independently. The result of independent classification of each module and a measure of the nearest distance are integrated during the final data classification phase to allow more precise c classification. Computation time is decreased by deleting modules that have been classified to be incorrect during the final classification phase. Using this method. a neural network sharing the best performance was implemented without considering. lots of of variables which can affect the performance of the neural network.

  • PDF

A Text Detection Method Using Wavelet Packet Analysis and Unsupervised Classifier

  • Lee, Geum-Boon;Odoyo Wilfred O.;Kim, Kuk-Se;Cho, Beom-Joon
    • Journal of information and communication convergence engineering
    • /
    • v.4 no.4
    • /
    • pp.174-179
    • /
    • 2006
  • In this paper we present a text detection method inspired by wavelet packet analysis and improved fuzzy clustering algorithm(IAFC).This approach assumes that the text and non-text regions are considered as two different texture regions. The text detection is achieved by using wavelet packet analysis as a feature analysis. The wavelet packet analysis is a method of wavelet decomposition that offers a richer range of possibilities for document image. From these multi scale features, we adapt the improved fuzzy clustering algorithm based on the unsupervised learning rule. The results show that our text detection method is effective for document images scanned from newspapers and journals.

Unsupervised feature selection using orthogonal decomposition and low-rank approximation

  • Lim, Hyunki
    • Journal of the Korea Society of Computer and Information
    • /
    • v.27 no.5
    • /
    • pp.77-84
    • /
    • 2022
  • In this paper, we propose a novel unsupervised feature selection method. Conventional unsupervised feature selection method defines virtual label and uses a regression analysis that projects the given data to this label. However, since virtual labels are generated from data, they can be formed similarly in the space. Thus, in the conventional method, the features can be selected in only restricted space. To solve this problem, in this paper, features are selected using orthogonal projections and low-rank approximations. To solve this problem, in this paper, a virtual label is projected to orthogonal space and the given data set is also projected to this space. Through this process, effective features can be selected. In addition, projection matrix is restricted low-rank to allow more effective features to be selected in low-dimensional space. To achieve these objectives, a cost function is designed and an efficient optimization method is proposed. Experimental results for six data sets demonstrate that the proposed method outperforms existing conventional unsupervised feature selection methods in most cases.

Feature Selection via Embedded Learning Based on Tangent Space Alignment for Microarray Data

  • Ye, Xiucai;Sakurai, Tetsuya
    • Journal of Computing Science and Engineering
    • /
    • v.11 no.4
    • /
    • pp.121-129
    • /
    • 2017
  • Feature selection has been widely established as an efficient technique for microarray data analysis. Feature selection aims to search for the most important feature/gene subset of a given dataset according to its relevance to the current target. Unsupervised feature selection is considered to be challenging due to the lack of label information. In this paper, we propose a novel method for unsupervised feature selection, which incorporates embedded learning and $l_{2,1}-norm$ sparse regression into a framework to select genes in microarray data analysis. Local tangent space alignment is applied during embedded learning to preserve the local data structure. The $l_{2,1}-norm$ sparse regression acts as a constraint to aid in learning the gene weights correlatively, by which the proposed method optimizes for selecting the informative genes which better capture the interesting natural classes of samples. We provide an effective algorithm to solve the optimization problem in our method. Finally, to validate the efficacy of the proposed method, we evaluate the proposed method on real microarray gene expression datasets. The experimental results demonstrate that the proposed method obtains quite promising performance.