Abstract
Many large enterprises work with thousands of suppliers to provide raw materials, product components and final products. Supplier relationship management (SRM) is a business strategy to reduce logistic costs and improve business performance and competitiveness. Effective categorization of suppliers is an important step in supplier relationship management. In this paper, we present a data-driven method to categorize suppliers from the suppliers’ business behaviors that are derived from a large number of business transactions between suppliers and the buyer. A supplier business behavior is described as the set of product items it has provided in a given time period, a mount of each item in each order, the frequencies of orders, as well as other attributes such as product quality, product arrival time, etc. Categorization of suppliers based on business behaviors is a problem of clustering high dimensional data. We used the k-means type subspace clustering algorithm FW-KMeans to solve this high dimensional, sparse data clustering problem. We have applied this algorithm to a real data set from a food retail company to categorize over 1000 suppliers based on 11 months transaction data. Our results have produced better groupings of suppliers which can enhance the company’s SRM.
This work was part-supported by the Intel University Research HPC Program and the EIES Science Foundation Project of Xi’an Jiaotong University.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bensaou, M.: Portfolios of buyer-suuplier relationships. Sloan Management Review 40(4), 35(1) (1999)
Olsen, F., Ellram, M.: A portfolio approach to supplier relationships. Industrial Marketing Management 26(2), 101–113 (1997)
Parsons, L., Haque, E., Liu, H.: Subspace clustering for high dimensional data: a review. SIGKDD Explorations 6(1), 90–105 (2004)
Jing, L., Ng, M., Xu, J., Huang, Z.: Subspace clustering of text documents with feature weighting k-means algorithm. In: PAKDD (2005)
Chan, Y., Ching, K., Ng, K., Huang, Z.: An optimization algorithm for clustering using weighted dissimilarity measures. Pattern recognition 37(5), 943–952 (2004)
Jing, L., Ng, M., Xu, J., Huang, Z.: On the performance of feature weighting k-means for text subspace clustering. In: WAIM (2005)
Lars-Erik Gadde, I.S.: Making the most of supplier relationships. Industrial Marketing Management 29, 305–316 (2000)
Ricardo, B., PBerthier, R.: Modern information retrieval. Addison Wesley, Reading (1999)
Hague, P., Harris, P.: Sampling and statistics. Kogan Page (1993)
ETI., Final report for business intelligence case study to x’s limited. Technique report (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, X., Huang, J.Z., Qian, D., Xu, J., Jing, L. (2006). Supplier Categorization with K-Means Type Subspace Clustering. In: Zhou, X., Li, J., Shen, H.T., Kitsuregawa, M., Zhang, Y. (eds) Frontiers of WWW Research and Development - APWeb 2006. APWeb 2006. Lecture Notes in Computer Science, vol 3841. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11610113_21
Download citation
DOI: https://doi.org/10.1007/11610113_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31142-3
Online ISBN: 978-3-540-32437-9
eBook Packages: Computer ScienceComputer Science (R0)