• 제목/요약/키워드: Industrial Clustering

검색결과 399건 처리시간 0.029초

The Role of Industrial Clustering and Manufacturing Flexibility in Achieving High Innovation Capability and Operational Performance in Indonesian Manufacturing SMEs

  • Purwanto, Untung Setiyo;Kamaruddin, Shahrul;Mohamad, Norizah
    • Industrial Engineering and Management Systems
    • /
    • 제14권3호
    • /
    • pp.236-247
    • /
    • 2015
  • This study aims to examine the effects of industrial clustering and manufacturing flexibility on innovation capability and operational performance. This study follow a survey method to collect data pertaining to the phenomena of industrial clustering, manufacturing flexibility, innovation capability, and operational performance by utilizing a single respondent design. A total of 124 Indonesian manufacturing SMEs are taken to test the proposed theoretical model by utilizing covariance-based structural equations modeling approach. It was found that both industrial clustering and manufacturing flexibility was positively associated with operational performance and innovation capability as well. In addition, innovation capability may account for the effects of industrial clustering and manufacturing flexibility on operational performance. This implies that manufacturing SMEs have to reorient their production and operation perspectives, including agglomerate with other similar or related SMEs to develop and utilize their own resources. The SMEs also need to possess some degree of manufacturing flexibility in respond to the uncertain environment and market changes. In addition, the SMEs should put a greater emphasize to use industrial cluster and manufacturing flexibility benefits to generate innovation capability to achieve high performance.

DEA를 이용한 의사결정단위의 클러스터링 (Clustering of Decision Making Units using DEA)

  • 김경택
    • 산업경영시스템학회지
    • /
    • 제37권4호
    • /
    • pp.239-244
    • /
    • 2014
  • The conventional clustering approaches are mostly based on minimizing total dissimilarity of input and output. However, the clustering approach may not be helpful in some cases of clustering decision making units (DMUs) with production feature converting multiple inputs into multiple outputs because it does not care converting functions. Data envelopment analysis (DEA) has been widely applied for efficiency estimation of such DMUs since it has non-parametric characteristics. We propose a new clustering method to identify groups of DMUs that are similar in terms of their input-output profiles. A real world example is given to explain the use and effectiveness of the proposed method. And we calculate similarity value between its result and the result of a conventional clustering method applied to the example. After the efficiency value was added to input of K-means algorithm, we calculate new similarity value and compare it with the previous one.

범주형 값들이 순서를 가지고 있는 데이터들의 클러스터링 기법 (Clustering Algorithm for Sequences of Categorical Values)

  • 오승준;김재련
    • 산업경영시스템학회지
    • /
    • 제26권1호
    • /
    • pp.17-21
    • /
    • 2003
  • We study clustering algorithm for sequences of categorical values. Clustering is a data mining problem that has received significant attention by the database community. Traditional clustering algorithms deal with numerical or categorical data points. However, there exist many important databases that store categorical data sequences. In this paper, we introduce new similarity measure and develop a hierarchical clustering algorithm. An experimental section shows performance of the proposed approach.

한국 주식시장에서의 군집화 기반 페어트레이딩 포트폴리오 투자 연구 (Clustering-driven Pair Trading Portfolio Investment in Korean Stock Market)

  • 조풍진;이민혁;송재욱
    • 산업경영시스템학회지
    • /
    • 제45권3호
    • /
    • pp.123-130
    • /
    • 2022
  • Pair trading is a statistical arbitrage investment strategy. Traditionally, cointegration has been utilized in the pair exploring step to discover a pair with a similar price movement. Recently, the clustering analysis has attracted many researchers' attention, replacing the cointegration method. This study tests a clustering-driven pair trading investment strategy in the Korean stock market. If a pair detected through clustering has a large spread during the spread exploring period, the pair is included in the portfolio for backtesting. The profitability of the clustering-driven pair trading strategies is investigated based on various profitability measures such as the distribution of returns, cumulative returns, profitability by period, and sensitivity analysis on different parameters. The backtesting results show that the pair trading investment strategy is valid in the Korean stock market. More interestingly, the clustering-driven portfolio investments show higher performance compared to benchmarks. Note that the hierarchical clustering shows the best portfolio performance.

산업클러스터 내 사회적 자본이 기업성과에 미치는 영향: 조직학습의 역할을 중심으로 (The effect of social capital on firm performance within industrial clusters: Mediating role of organizational learning of clustering SMEs)

  • 김신우;서리빈;윤현덕
    • 지식경영연구
    • /
    • 제17권3호
    • /
    • pp.65-91
    • /
    • 2016
  • Although the success of industrial clusters largely depends on whether clustering firms can achieve economic performance, there has been less attention on investigating factors and conditions contributing to the performance enhancement for clustering small and medium-sized enterprises (SMEs). Along this vein, we adopt the theories of social capital and organizational learning as those success factors for clustering SMEs. This study thus aims at examining what effect social capital accrued in the relationships among actors within clusters has on firm performance of clustering SMEs and what role organizational learning plays in the linkage between social capital and firm performance. For the empirical analysis, we operationalized the variables and their measures to develop questionnaires through the theoretical reviews on literatures. As a sample of 227 clustering SMEs, our collected data was analyzed by hierarchical regression analysis. The results confirmed that a high level of social capital, represented by network, trust, and norm, has positive effect on firm performance of clustering SMEs. We also found that clustering firms presenting high organizational learning, represented by absorptive and transformative capability, achieve better performance than those placing less value on organizational learning. Furthermore the significant relationship between social capital and firm performance is mediated partially through organizational learning. These findings imply not only that the territorial agglomeration of industrial cluster does not guarantee the performance creation of clustering SMEs but that they need to develop social capital among various actors within clusters, facilitating their knowledge diffusion. In order to absorb and mobilize the shared knowledge and information into strategic resources, the firms should improve their capability associated with organizational learning. These expand our understanding on the importance of social capital and organizational learning for the performance enhancement of clustering firms. Differentiating from major studies addressing benefits and advantages of industrial cluster, this study based on the perspective of firm-internal business process contributes to the literature advancement. Strategic and policy implications of this study are discussed in detail.

범주형 값들이 순서를 가지고 있는 데이터들의 클러스터링 기법 (Clustering Algorithm for Sequences of Categorical Values)

  • 오승준;김재련
    • 한국산업경영시스템학회:학술대회논문집
    • /
    • 한국산업경영시스템학회 2002년도 춘계학술대회
    • /
    • pp.125-132
    • /
    • 2002
  • We study clustering algorithm for sequences of categorical values. Clustering is a data mining problem that has received significant attention by the database community. Traditional clustering algorlthms deal with numerical or categorical data points. However, there exist many important databases that store categorical data sequences. In this paper we introduce new similarity measure and develope a hierarchical clustering algorithm. An experimental section shows performance of the proposed approach.

  • PDF

군집의 효율향상을 위한 휴리스틱 알고리즘 (Heuristic algorithm to raise efficiency in clustering)

  • 이석환;박승헌
    • 대한안전경영과학회지
    • /
    • 제11권3호
    • /
    • pp.157-166
    • /
    • 2009
  • In this study, we developed a heuristic algorithm to get better efficiency of clustering than conventional algorithms. Conventional clustering algorithm had lower efficiency of clustering as there were no solid method for selecting initial center of cluster and as they had difficulty in search solution for clustering. EMC(Expanded Moving Center) heuristic algorithm was suggested to clear the problem of low efficiency in clustering. We developed algorithm to select initial center of cluster and search solution systematically in clustering. Experiments of clustering are performed to evaluate performance of EMC heuristic algorithm. Squared-error of EMC heuristic algorithm showed better performance for real case study and improved greatly with increase of cluster number than the other ones.

자기 조직화 신경망을 이용한 클러스터링 알고리듬 (A Clustering Algorithm using Self-Organizing Feature Maps)

  • 이종섭;강맹규
    • 대한산업공학회지
    • /
    • 제31권3호
    • /
    • pp.257-264
    • /
    • 2005
  • This paper suggests a heuristic algorithm for the clustering problem. Clustering involves grouping similar objects into a cluster. Clustering is used in a wide variety of fields including data mining, marketing, and biology. Until now there are a lot of approaches using Self-Organizing Feature Maps(SOFMs). But they have problems with a small output-layer nodes and initial weight. For example, one of them is a one-dimension map of k output-layer nodes, if they want to make k clusters. This approach has problems to classify elaboratively. This paper suggests one-dimensional output-layer nodes in SOFMs. The number of output-layer nodes is more than those of clusters intended to find and the order of output-layer nodes is ascending in the sum of the output-layer node's weight. We can find input data in SOFMs output node and classify input data in output nodes using Euclidean distance. We use the well known IRIS data as an experimental data. Unsupervised clustering of IRIS data typically results in 15 - 17 clustering error. However, the proposed algorithm has only six clustering errors.

클러스터링 기법을 이용한 수용가별 전력 데이터 패턴 분석 (Customer Load Pattern Analysis using Clustering Techniques)

  • 유승형;김홍석;오도은;노재구
    • KEPCO Journal on Electric Power and Energy
    • /
    • 제2권1호
    • /
    • pp.61-69
    • /
    • 2016
  • Understanding load patterns and customer classification is a basic step in analyzing the behavior of electricity consumers. To achieve that, there have been many researches about clustering customers' daily load data. Nowadays, the deployment of advanced metering infrastructure (AMI) and big-data technologies make it easier to study customers' load data. In this paper, we study load clustering from the view point of yearly and daily load pattern. We compare four clustering methods; K-means clustering, hierarchical clustering (average & Ward's method) and DBSCAN (Density-Based Spatial Clustering of Applications with Noise). We also discuss the relationship between clustering results and Korean Standard Industrial Classification that is one of possible labels for customers' load data. We find that hierarchical clustering with Ward's method is suitable for clustering load data and KSIC can be well characterized by daily load pattern, but not quite well by yearly load pattern.

유사성 계수에 의한 문서 클러스터링 시스템 개발 (Development of Similarity-Based Document Clustering System)

  • 우훈식;임동순
    • 한국산업경영시스템학회:학술대회논문집
    • /
    • 한국산업경영시스템학회 2002년도 춘계학술대회
    • /
    • pp.119-124
    • /
    • 2002
  • Clustering of data is of a great interest in many data mining applications. In the field of document clustering, a document is represented as a data in a high dimensional space. Therefore, the document clustering can be accomplished with a general data clustering techniques. In this paper, we introduce a document clustering system based on similarity among documents. The developed system consists of three functions: 1) gatherings documents utilizing a search agent; 2) determining similarity coefficients between any two documents from term frequencies; 3) clustering documents with similarity coefficients. Especially, the document clustering is accomplished by a hybrid algorithm utilizing genetic and K-Means methods.

  • PDF