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

검색결과 114건 처리시간 0.043초

티셔츠 상품의 판매패턴과 연관된 상품속성 (Sales Pattern and Related Product Attributes of T-shirts)

  • 채진미;김은희
    • 한국의류학회지
    • /
    • 제44권6호
    • /
    • pp.1053-1069
    • /
    • 2020
  • This study examined the sales pattern relationship with respect to product attributes to propose sales forecasting for fashion products. We analyzed 537 SKU sales data of T-shirts in the domestic sports brand using SAS program. The sales pattern of fashion products fluctuated and were influenced by exogenous factors; therefore, we removed the influence of exogenous factors found to be price discounts and holiday effects as a result of regression analysis. In addition, it was difficult to predict sales using the sales patterns of the same product since fashion products were released as new products every year. Therefore, the forecasting model was proposed using sales patterns of related product attributes when attributes were considered descriptive variables. We classified sales patterns using K-means clustering in order to explain the relationship between sales patterns and product attributes along with creating a decision tree classifier using attributes as input and sales patterns as output. As a result, the sales patterns of T-shirts were clustered into six types that featured the characteristic shape of peak and slope. It was also associated with the combination of product attributes and their values in regards to the proposed sales pattern prediction model.

인도 소프트웨어 산업의 혁신클러스터 형성 과정: 개발인가, 진화인가? (Innovation Cluster of Indian Software Industry: Is It Evolved or Developed\ulcorner)

  • 임덕순
    • 기술혁신학회지
    • /
    • 제5권2호
    • /
    • pp.167-188
    • /
    • 2002
  • Summary: This paper analyzes Indian software industry in the perspective of innovation cluster. The research shows that the software industry has been following an upstream clustering process, where the major value activity is expanding from low value product/services to high value product/services. The growth of software industry could be successful because there was appropriate initial condition of Bangalore, such as the availability of high qualified human resources, excellent research institutes, small high-tech companies. The role of government was helpful for the late growth of software industry but not a critical factor for the initial development of the S/W cluster. It is suggested that government should consider the initial condition of a concerned location critically to implement a cluster-type innovation policy.

  • PDF

Hybrid Product Recommendation for e-Commerce : A Clustering-based CF Algorithm

  • Ahn, Do-Hyun;Kim, Jae-Sik;Kim, Jae-Kyeong;Cho, Yoon-Ho
    • 한국지능정보시스템학회:학술대회논문집
    • /
    • 한국지능정보시스템학회 2003년도 춘계학술대회
    • /
    • pp.416-425
    • /
    • 2003
  • Recommender systems are a personalized information filtering technology to help customers find the products they would like to purchase. Collaborative filtering (CF) has been known to be the most successful recommendation technology. However its widespread use in e-commerce has exposed two research issues, sparsity and scalability. In this paper, we propose several hybrid recommender procedures based on web usage mining, clustering techniques and collaborative filtering to address these issues. Experimental evaluation of suggested procedures on real e-commerce data shows interesting relation between characteristics of procedures and diverse situations.

  • PDF

An Incremental Similarity Computation Method in Agglomerative Hierarchical Clustering

  • Jung, Sung-young;Kim, Taek-soo
    • 한국지능시스템학회논문지
    • /
    • 제11권7호
    • /
    • pp.579-583
    • /
    • 2001
  • In the area of data clustering in high dimensional space, one of the difficulties is the time-consuming process for computing vector similarities. It becomes worse in the case of the agglomerative algorithm with the group-average link and mean centroid method, because the cluster similarity must be recomputed whenever the cluster center moves after the merging step. As a solution of this problem, we present an incremental method of similarity computation, which substitutes the scalar calculation for the time-consuming calculation of vector similarity with several measures such as the squared distance, inner product, cosine, and minimum variance. Experimental results show that it makes clustering speed significantly fast for very high dimensional data.

  • PDF

Nonnegative Matrix Factorization with Orthogonality Constraints

  • Yoo, Ji-Ho;Choi, Seung-Jin
    • Journal of Computing Science and Engineering
    • /
    • 제4권2호
    • /
    • pp.97-109
    • /
    • 2010
  • Nonnegative matrix factorization (NMF) is a popular method for multivariate analysis of nonnegative data, which is to decompose a data matrix into a product of two factor matrices with all entries restricted to be nonnegative. NMF was shown to be useful in a task of clustering (especially document clustering), but in some cases NMF produces the results inappropriate to the clustering problems. In this paper, we present an algorithm for orthogonal nonnegative matrix factorization, where an orthogonality constraint is imposed on the nonnegative decomposition of a term-document matrix. The result of orthogonal NMF can be clearly interpreted for the clustering problems, and also the performance of clustering is usually better than that of the NMF. We develop multiplicative updates directly from true gradient on Stiefel manifold, whereas existing algorithms consider additive orthogonality constraints. Experiments on several different document data sets show our orthogonal NMF algorithms perform better in a task of clustering, compared to the standard NMF and an existing orthogonal NMF.

온라인 상품 카테고리 내 주요 가격대 식별 (Identifying the Main Price Ranges of Online Product Category)

  • 김준우;임광혁
    • 한국콘텐츠학회논문지
    • /
    • 제12권12호
    • /
    • pp.733-741
    • /
    • 2012
  • 최근 많은 소비자들이 관심 있는 물품 카테고리에 대한 정보를 얻기 위한 목적으로 종합 쇼핑몰이나 가격 비교 사이트를 방문하고 있다. 하지만, 이러한 웹 사이트들은 종종 이들에게 많은 상품들과 판매자가 포함된 지나치게 방대한 정보를 제공하여 소비자들의 구매 결정을 효과적으로 지원하지 못한다. 따라서 현대 온라인 쇼핑 에이전트들은 검색된 정보를 사용자들에게 제공하기 전에 보다 지능적인 방법으로 이를 가공할 필요가 있다. 본 논문은 특정 물품 카테고리 내에서 많은 상품들이 분포하고 있는 주요 가격대를 식별하는 방법을 제안하고자 한다. 이를 위해 한 개 카테고리 내 상품의 가격들을 벡터로 표현하고, 여기에 k-means 군집 분석을 적용하여 서로 비슷한 가격 벡터들을 포함하는 군집을 형성한 다음, 각 군집에서 주요 가격대를 추출하는 방법을 적용하였다. 일반적으로 가격은 소비자들의 구매 결정에서 가장 중요한 요인 중 하나이기 때문에, 추출된 주요 가격대들은 온라인 쇼핑 이용자들이 효과적으로 상품을 검색하는데 도움이 될 것으로 기대된다.

군집화 방법을 이용한 모듈라 자재명세서 생성

  • 김종한;지용구;김영호;박진우
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회 1997년도 추계학술대회발표논문집; 홍익대학교, 서울; 1 Nov. 1997
    • /
    • pp.121-124
    • /
    • 1997
  • This paper is concerned with the generation and use of modular BOM, which is typically utilized in representing product configurations for two-level master production schedule. A method called VCM (Value Clustering Method) is proposed to build modular BOMS. We adopted a where-used matrix to represent part-product relationships. VCM is a method that can identify modules of components based on the where-used matrix. The method uses product family group value, product value, and component value. This can facilitate retrieving information about modules, finding out alternative usage pattern of components, and recognizing modules used in a particular product.

  • PDF

Personalized Product Recommendation Method for Analyzing User Behavior Using DeepFM

  • Xu, Jianqiang;Hu, Zhujiao;Zou, Junzhong
    • Journal of Information Processing Systems
    • /
    • 제17권2호
    • /
    • pp.369-384
    • /
    • 2021
  • In a personalized product recommendation system, when the amount of log data is large or sparse, the accuracy of model recommendation will be greatly affected. To solve this problem, a personalized product recommendation method using deep factorization machine (DeepFM) to analyze user behavior is proposed. Firstly, the K-means clustering algorithm is used to cluster the original log data from the perspective of similarity to reduce the data dimension. Then, through the DeepFM parameter sharing strategy, the relationship between low- and high-order feature combinations is learned from log data, and the click rate prediction model is constructed. Finally, based on the predicted click-through rate, products are recommended to users in sequence and fed back. The area under the curve (AUC) and Logloss of the proposed method are 0.8834 and 0.0253, respectively, on the Criteo dataset, and 0.7836 and 0.0348 on the KDD2012 Cup dataset, respectively. Compared with other newer recommendation methods, the proposed method can achieve better recommendation effect.

입출력 부공간에서의 데이터 클러스터링에 의한 퍼지제어 시스템 설계 (Fuzzy control system design by data clustering in the input-output subspaces)

  • 김민수;공성곤
    • 전자공학회논문지S
    • /
    • 제34S권12호
    • /
    • pp.30-40
    • /
    • 1997
  • This paper presents a design method of fuzzy control systems by clustering the data in the subspace of the input-output produyct space. In the case of servo control, most input-outputdata are concentrated in thye steady-state region, and the the clustering will result in only steady-state fuzzy rules. To overcome this problem, we divide the input-output product space into some subspaces according to the state of input variables. The fuzzy control system designed by the subspace clustering showed good transient response and smaller steady-state error, which is comparable with the reference fuzzy system.

  • PDF

그룹 데크놀로지 기법을 이용한 폐제품의 리싸이클링 셀 형성 (Recycling Cell Formation using Group Technology for Disposal Products)

  • 서광규;김형준
    • 대한안전경영과학회:학술대회논문집
    • /
    • 대한안전경영과학회 2000년도 춘계학술대회
    • /
    • pp.111-123
    • /
    • 2000
  • The recycling cell formation problem means that disposal products are classified into recycling part families using group technology in their end of life phase. Disposal products have the uncertainties of product status by usage influences. Recycling cells are formed considering design, process and usage attributes. In this paper, a novel approach to the design of cellular recycling system is proposed, which deals with the recycling cell formation and assignment of identical products concurrently. Fuzzy clustering algorithm and Fuzzy-ART neural network are applied to describe the states of disposal product with the membership functions and to make recycling cell formation. This approach leads to recycling and reuse of the materials, components, and subassemblies and can evaluate the value at each cell of disposal products. Application examples are illustrated by disposal refrigerators, compared fuzzy clustering with Fuzzy-ART neural network performance in cell formation.

  • PDF