• Title/Summary/Keyword: Classification for Each

Search Result 3,953, Processing Time 0.034 seconds

Selecting Ordering Policy and Items Classification Based on Canonical Correlation and Cluster Analysis

  • Nagasawa, Keisuke;Irohara, Takashi;Matoba, Yosuke;Liu, Shuling
    • Industrial Engineering and Management Systems
    • /
    • v.11 no.2
    • /
    • pp.134-141
    • /
    • 2012
  • It is difficult to find an appropriate ordering policy for a many types of items. One of the reasons for this difficulty is that each item has a different demand trend. We will classify items by shipment trend and then decide the ordering policy for each item category. In this study, we indicate that categorizing items from their statistical characteristics leads to an ordering policy suitable for that category. We analyze the ordering policy and shipment trend and propose a new method for selecting the ordering policy which is based on finding the strongest relation between the classification of the items and the ordering policy. In our numerical experiment, from actual shipment data of about 5,000 items over the past year, we calculated many statistics that represent the trend of each item. Next, we applied the canonical correlation analysis between the evaluations of ordering policies and the various statistics. Furthermore, we applied the cluster analysis on the statistics concerning the performance of ordering policies. Finally, we separate items into several categories and show that the appropriate ordering policies are different for each category.

A Study on the Classification of Uninsured Cost Occurrence (비보험비용의 발생 단계 분류에 관한 연구)

  • Lee, Tae-Yeong;Lee, Jong-Bin;Chang, Seong-Rok
    • Journal of the Korean Society of Safety
    • /
    • v.23 no.6
    • /
    • pp.158-163
    • /
    • 2008
  • Although prior researches have been investigated the impact of insured cost(direct cost) on employers and employees, little work has attempted to categorize the items of unsecured cost(indirect cost) by accidents. On this basis, the goal of this study was to achieve a better understanding of the nature of accident cost of unsecured cost. Specifically, this study aimed to categorize the unsecured cost items according to the domestic industry circumstances and use these results for a basis of other accident cost related studies. The results of this study are as follows: (1) accident development steps were categorized as twelve items for improved management according to each step of accident development (2) the points of occurrence and termination of the unsecured cost were identified for the improved management according to each step of accident development and (3) characteristics of each item in unsecured cost were studied and identified for a better control of accident costs. These results provide a basis for further researches on the unsecured cost.

EFTG: Efficient and Flexible Top-K Geo-textual Publish/Subscribe

  • zhu, Hong;Li, Hongbo;Cui, Zongmin;Cao, Zhongsheng;Xie, Meiyi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.12
    • /
    • pp.5877-5897
    • /
    • 2018
  • With the popularity of mobile networks and smartphones, geo-textual publish/subscribe messaging has attracted wide attention. Different from the traditional publish/subscribe format, geo-textual data is published and subscribed in the form of dynamic data flow in the mobile network. The difference creates more requirements for efficiency and flexibility. However, most of the existing Top-k geo-textual publish/subscribe schemes have the following deficiencies: (1) All publications have to be scored for each subscription, which is not efficient enough. (2) A user should take time to set a threshold for each subscription, which is not flexible enough. Therefore, we propose an efficient and flexible Top-k geo-textual publish/subscribe scheme. First, our scheme groups publish and subscribe based on text classification. Thus, only a few parts of related publications should be scored for each subscription, which significantly enhances efficiency. Second, our scheme proposes an adaptive publish/subscribe matching algorithm. The algorithm does not require the user to set a threshold. It can adaptively return Top-k results to the user for each subscription, which significantly enhances flexibility. Finally, theoretical analysis and experimental evaluation verify the efficiency and effectiveness of our scheme.

Core Keywords Extraction forEvaluating Online Consumer Reviews Using a Decision Tree: Focusing on Star Ratings and Helpfulness Votes (의사결정나무를 활용한 온라인 소비자 리뷰 평가에 영향을 주는 핵심 키워드 도출 연구: 별점과 좋아요를 중심으로)

  • Min, Kyeong Su;Yoo, Dong Hee
    • The Journal of Information Systems
    • /
    • v.32 no.3
    • /
    • pp.133-150
    • /
    • 2023
  • Purpose This study aims to develop classification models using a decision tree algorithm to identify core keywords and rules influencing online consumer review evaluations for the robot vacuum cleaner on Amazon.com. The difference from previous studies is that we analyze core keywords that affect the evaluation results by dividing the subjects that evaluate online consumer reviews into self-evaluation (star ratings) and peer evaluation (helpfulness votes). We investigate whether the core keywords influencing star ratings and helpfulness votes vary across different products and whether there is a similarity in the core keywords related to star ratings or helpfulness votes across all products. Design/methodology/approach We used random under-sampling to balance the dataset. We progressively removed independent variables based on decreasing importance through backwards elimination to evaluate the classification model's performance. As a result, we identified classification models that best predict star ratings and helpfulness votes for each product's online consumer reviews. Findings We have identified that the core keywords influencing self-evaluation and peer evaluation vary across different products, and even for the same model or features, the core keywords are not consistent. Therefore, companies' producers and marketing managers need to analyze the core keywords of each product to highlight the advantages and prepare customized strategies that compensate for the shortcomings.

Local Linear Logistic Classification of Microarray Data Using Orthogonal Components (직교요인을 이용한 국소선형 로지스틱 마이크로어레이 자료의 판별분석)

  • Baek, Jang-Sun;Son, Young-Sook
    • The Korean Journal of Applied Statistics
    • /
    • v.19 no.3
    • /
    • pp.587-598
    • /
    • 2006
  • The number of variables exceeds the number of samples in microarray data. We propose a nonparametric local linear logistic classification procedure using orthogonal components for classifying high-dimensional microarray data. The proposed method is based on the local likelihood and can be applied to multi-class classification. We applied the local linear logistic classification method using PCA, PLS, and factor analysis components as new features to Leukemia data and colon data, and compare the performance of the proposed method with the conventional statistical classification procedures. The proposed method outperforms the conventional ones for each component, and PLS has shown best performance when it is embedded in the proposed method among the three orthogonal components.

A Study on Efficient Topography Classification of High Resolution Satelite Image (고해상도 위성영상의 효율적 지형분류기법 연구)

  • Lim, Hye-Young;Kim, Hwang-Soo;Choi, Joon-Seog;Song, Seung-Ho
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.13 no.3 s.33
    • /
    • pp.33-40
    • /
    • 2005
  • The aim of remotely sensed data classification is to produce the best accuracy map of the earth surface assigning each pixel to its appropriate category of the real-world. The classification of satellite multi-spectral image data has become tool for generating ground cover map. Many classification methods exist. In this study, MLC(Maximum Likelihood Classification), ANN(Artificial neural network), SVM(Support Vector Machine), Naive Bayes classifier algorithms are compared using IKONOS image of the part of Dalsung Gun, Daegu area. Two preprocessing methods are performed-PCA(Principal component analysis), ICA(Independent Component Analysis). Boosting algorithms also performed. By the combination of appropriate feature selection pre-processing and classifier, the best results were obtained.

  • PDF

A Content-Based Image Classification using Neural Network (신경망을 이용한 내용기반 영상 분류)

  • 이재원;김상균
    • Journal of Korea Multimedia Society
    • /
    • v.5 no.5
    • /
    • pp.505-514
    • /
    • 2002
  • In this Paper, we propose a method of content-based image classification using neural network. The images for classification ate object images that can be divided into foreground and background. To deal with the object images efficiently, object region is extracted with a region segmentation technique in the preprocessing step. Features for the classification are texture and shape features extracted from wavelet transformed image. The neural network classifier is constructed with the extracted features and the back-propagation learning algorithm. Among the various texture features, the diagonal moment was more effective. A test with 300 training data and 300 test data composed of 10 images from each of 30 classes shows correct classification rates of 72.3% and 67%, respectively.

  • PDF

Classification of Hyperspectral Images Using Spectral Mutual Information (분광 상호정보를 이용한 하이퍼스펙트럴 영상분류)

  • Byun, Young-Gi;Eo, Yang-Dam;Yu, Ki-Yun
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.15 no.3
    • /
    • pp.33-39
    • /
    • 2007
  • Hyperspectral remote sensing data contain plenty of information about objects, which makes object classification more precise. In this paper, we proposed a new spectral similarity measure, called Spectral Mutual Information (SMI) for hyperspectral image classification problem. It is derived from the concept of mutual information arising in information theory and can be used to measure the statistical dependency between spectra. SMI views each pixel spectrum as a random variable and classifies image by measuring the similarity between two spectra form analogy mutual information. The proposed SMI was tested to evaluate its effectiveness. The evaluation was done by comparing the results of preexisting classification method (SAM, SSV). The evaluation results showed the proposed approach has a good potential in the classification of hyperspectral images.

  • PDF

Alsat-2B/Sentinel-2 Imagery Classification Using the Hybrid Pigeon Inspired Optimization Algorithm

  • Arezki, Dounia;Fizazi, Hadria
    • Journal of Information Processing Systems
    • /
    • v.17 no.4
    • /
    • pp.690-706
    • /
    • 2021
  • Classification is a substantial operation in data mining, and each element is distributed taking into account its feature values in the corresponding class. Metaheuristics have been widely used in attempts to solve satellite image classification problems. This article proposes a hybrid approach, the flower pigeons-inspired optimization algorithm (FPIO), and the local search method of the flower pollination algorithm is integrated into the pigeon-inspired algorithm. The efficiency and power of the proposed FPIO approach are displayed with a series of images, supported by computational results that demonstrate the cogency of the proposed classification method on satellite imagery. For this work, the Davies-Bouldin Index is used as an objective function. FPIO is applied to different types of images (synthetic, Alsat-2B, and Sentinel-2). Moreover, a comparative experiment between FPIO and the genetic algorithm genetic algorithm is conducted. Experimental results showed that GA outperformed FPIO in matters of time computing. However, FPIO provided better quality results with less confusion. The overall experimental results demonstrate that the proposed approach is an efficient method for satellite imagery classification.

Analysis and Implementation of Speech/Music Classification for 3GPP2 SMV Codec Employing SVM Based on Discriminative Weight Training (SMV코덱의 음성/음악 분류 성능 향상을 위한 최적화된 가중치를 적용한 입력벡터 기반의 SVM 구현)

  • Kim, Sang-Kyun;Chang, Joon-Hyuk;Cho, Ki-Ho;Kim, Nam-Soo
    • The Journal of the Acoustical Society of Korea
    • /
    • v.28 no.5
    • /
    • pp.471-476
    • /
    • 2009
  • In this paper, we apply a discriminative weight training to a support vector machine (SVM) based speech/music classification for the selectable mode vocoder (SMV) of 3GPP2. In our approach, the speech/music decision rule is expressed as the SVM discriminant function by incorporating optimally weighted features of the SMV based on a minimum classification error (MCE) method which is different from the previous work in that different weights are assigned to each the feature of SMV. The performance of the proposed approach is evaluated under various conditions and yields better results compared with the conventional scheme in the SVM.