• Title/Summary/Keyword: Feature Data

Search Result 4,336, Processing Time 0.03 seconds

A GENETIC ALGORITHM BASED FEATURE EXTRACTION TECHNIQUE FOR HYPERSPECTRAL IMAGERY

  • Ryu Byong Tae;Kim Choon-Woo;Kim Hakil;Lee Kyu Sung
    • Proceedings of the KSRS Conference
    • /
    • 2005.10a
    • /
    • pp.209-212
    • /
    • 2005
  • Hyperspectral data consists of more than 200 spectral bands that are highly correlated. In order to utilize hyperspectral data for classification, dimensional reduction or feature extraction is desired. By applying feature extraction, computational complexity of classification can be reduced and classification accuracy may be improved. In this paper, a genetic algorithm based feature extraction technique is proposed. Measure from discriminant analysis is utilized as optimization criterion. A subset of spectral bands is selected by genetic algorithm. Dimension of feature space is further reduced by linear transformation. Feasibility of the proposed technique is evaluated with AVIRIS data.

  • PDF

Parts-Based Feature Extraction of Spectrum of Speech Signal Using Non-Negative Matrix Factorization

  • Park, Jeong-Won;Kim, Chang-Keun;Lee, Kwang-Seok;Koh, Si-Young;Hur, Kang-In
    • Journal of information and communication convergence engineering
    • /
    • v.1 no.4
    • /
    • pp.209-212
    • /
    • 2003
  • In this paper, we proposed new speech feature parameter through parts-based feature extraction of speech spectrum using Non-Negative Matrix Factorization (NMF). NMF can effectively reduce dimension for multi-dimensional data through matrix factorization under the non-negativity constraints, and dimensionally reduced data should be presented parts-based features of input data. For speech feature extraction, we applied Mel-scaled filter bank outputs to inputs of NMF, than used outputs of NMF for inputs of speech recognizer. From recognition experiment result, we could confirm that proposed feature parameter is superior in recognition performance than mel frequency cepstral coefficient (MFCC) that is used generally.

An Application of Case-Based Reasoning in Forecasting a Successful Implementation of Enterprise Resource Planning Systems : Focus on Small and Medium sized Enterprises Implementing ERP (성공적인 ERP 시스템 구축 예측을 위한 사례기반추론 응용 : ERP 시스템을 구현한 중소기업을 중심으로)

  • Lim Se-Hun
    • Journal of Information Technology Applications and Management
    • /
    • v.13 no.1
    • /
    • pp.77-94
    • /
    • 2006
  • Case-based Reasoning (CBR) is widely used in business and industry prediction. It is suitable to solve complex and unstructured business problems. Recently, the prediction accuracy of CBR has been enhanced by not only various machine learning algorithms such as genetic algorithms, relative weighting of Artificial Neural Network (ANN) input variable but also data mining technique such as feature selection, feature weighting, feature transformation, and instance selection As a result, CBR is even more widely used today in business area. In this study, we investigated the usefulness of the CBR method in forecasting success in implementing ERP systems. We used a CBR method based on the feature weighting technique to compare the performance of three different models : MDA (Multiple Discriminant Analysis), GECBR (GEneral CBR), FWCBR (CBR with Feature Weighting supported by Analytic Hierarchy Process). The study suggests that the FWCBR approach is a promising method for forecasting of successful ERP implementation in Small and Medium sized Enterprises.

  • PDF

A study of creative human judgment through the application of machine learning algorithms and feature selection algorithms

  • Kim, Yong Jun;Park, Jung Min
    • International journal of advanced smart convergence
    • /
    • v.11 no.2
    • /
    • pp.38-43
    • /
    • 2022
  • In this study, there are many difficulties in defining and judging creative people because there is no systematic analysis method using accurate standards or numerical values. Analyze and judge whether In the previous study, A study on the application of rule success cases through machine learning algorithm extraction, a case study was conducted to help verify or confirm the psychological personality test and aptitude test. We proposed a solution to a research problem in psychology using machine learning algorithms, Data Mining's Cross Industry Standard Process for Data Mining, and CRISP-DM, which were used in previous studies. After that, this study proposes a solution that helps to judge creative people by applying the feature selection algorithm. In this study, the accuracy was found by using seven feature selection algorithms, and by selecting the feature group classified by the feature selection algorithms, and the result of deriving the classification result with the highest feature obtained through the support vector machine algorithm was obtained.

A Feature Selection Method Based on Fuzzy Cluster Analysis (퍼지 클러스터 분석 기반 특징 선택 방법)

  • Rhee, Hyun-Sook
    • The KIPS Transactions:PartB
    • /
    • v.14B no.2
    • /
    • pp.135-140
    • /
    • 2007
  • Feature selection is a preprocessing technique commonly used on high dimensional data. Feature selection studies how to select a subset or list of attributes that are used to construct models describing data. Feature selection methods attempt to explore data's intrinsic properties by employing statistics or information theory. The recent developments have involved approaches like correlation method, dimensionality reduction and mutual information technique. This feature selection have become the focus of much research in areas of applications with massive and complex data sets. In this paper, we provide a feature selection method considering data characteristics and generalization capability. It provides a computational approach for feature selection based on fuzzy cluster analysis of its attribute values and its performance measures. And we apply it to the system for classifying computer virus and compared with heuristic method using the contrast concept. Experimental result shows the proposed approach can give a feature ranking, select the features, and improve the system performance.

Pattern recognition of time series data based on the chaotic feature extracrtion (카오스 특징 추출에 의한 시계열 신호의 패턴인식)

  • 이호섭;공성곤
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1996.10a
    • /
    • pp.294-297
    • /
    • 1996
  • This paper proposes the method to recognize of time series data based on the chaotic feature extraction. Features extract from time series data using the chaotic time series data analysis and the pattern recognition process is using a neural network classifier. In experiment, EEG(electroencephalograph) signals are extracted features by correlation dimension and Lyapunov experiments, and these features are classified by multilayer perceptron neural networks. Proposed chaotic feature extraction enhances recognition results from chaotic time series data.

  • PDF

Classification of High Dimensionality Data through Feature Selection Using Markov Blanket

  • Lee, Junghye;Jun, Chi-Hyuck
    • Industrial Engineering and Management Systems
    • /
    • v.14 no.2
    • /
    • pp.210-219
    • /
    • 2015
  • A classification task requires an exponentially growing amount of computation time and number of observations as the variable dimensionality increases. Thus, reducing the dimensionality of the data is essential when the number of observations is limited. Often, dimensionality reduction or feature selection leads to better classification performance than using the whole number of features. In this paper, we study the possibility of utilizing the Markov blanket discovery algorithm as a new feature selection method. The Markov blanket of a target variable is the minimal variable set for explaining the target variable on the basis of conditional independence of all the variables to be connected in a Bayesian network. We apply several Markov blanket discovery algorithms to some high-dimensional categorical and continuous data sets, and compare their classification performance with other feature selection methods using well-known classifiers.

Development of an algorithm for solving correspondence problem in stereo vision (스테레오 비젼에서 대응문제 해결을 위한 알고리즘의 개발)

  • Im, Hyuck-Jin;Gweon, Dae-Gab
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.10 no.1
    • /
    • pp.77-88
    • /
    • 1993
  • In this paper, we propose a stereo vision system to solve correspondence problem with large disparity and sudden change in environment which result from small distance between camera and working objects. First of all, a specific feature is divided by predfined elementary feature. And then these are combined to obtain coded data for solving correspondence problem. We use Neural Network to extract elementary features from specific feature and to have adaptability to noise and some change of the shape. Fourier transformation and Log-polar mapping are used for obtaining appropriate Neural Network input data which has a shift, scale, and rotation invariability. Finally, we use associative memory to obtain coded data of the specific feature from the combination of elementary features. In spite of specific feature with some variation in shapes, we could obtain satisfactory 3-dimensional data from corresponded codes.

  • PDF

Data model design and Feature Selection of Framework Data in Facility Area (시설물분야 기본지리정보 범위선정 및 데이터모델 설계)

  • 최동주;심상구;이현직
    • Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
    • /
    • 2004.04a
    • /
    • pp.395-400
    • /
    • 2004
  • This study consists of three steps of data modeling procedures. The first step is to identify possible items for the data model based on literature review and expert interviews. The second step is to design delineate possible sub-themes, feature classes, feature types, attributes, attribute domains, and their relationships. These are presented in various UML class diagrams, and each feature type is clearly defined and modeled. The data model also shows geometry objects and their topological relationships in UML diagrams. Finally, a standardized data model has been provided to avoid possible conflicts in the field of geographic and Facility Area, and thus this study and the data model will eventually assist in alleviating efforts to build standardized geographic information databases for Facility Area.

  • PDF

A Wavelet based Feature Selection Method to Improve Classification of Large Signal-type Data (웨이블릿에 기반한 시그널 형태를 지닌 대형 자료의 feature 추출 방법)

  • Jang, Woosung;Chang, Woojin
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.32 no.2
    • /
    • pp.133-140
    • /
    • 2006
  • Large signal type data sets are difficult to classify, especially if the data sets are non-stationary. In this paper, large signal type and non-stationary data sets are wavelet transformed so that distinct features of the data are extracted in wavelet domain rather than time domain. For the classification of the data, a few wavelet coefficients representing class properties are employed for statistical classification methods : Linear Discriminant Analysis, Quadratic Discriminant Analysis, Neural Network etc. The application of our wavelet-based feature selection method to a mass spectrometry data set for ovarian cancer diagnosis resulted in 100% classification accuracy.