Abstract
Playing a significant role in production process of tea enterprise, tea blending has advantages in improving the quality of tea, expanding resource of tea, and getting higher profits. Traditional manual blending method not merely wastes time and energy but also has difficulties in optimizing blending programs. In this paper, tea blending problem is modeled as spatial clustering based on multi-dimensional hierarchy space. Tea attributes such as varieties of tea bush, process crafts and producing areas are modeled into hierarchy space with tree structure. Every node of these trees is present a value of tea attributes. So all the data tuples are mapped as points in multi-dimensional hierarchy space. And we define a similarity-based measure criterion in multi-dimensional conceptual layered space to present an agglomerative hierarchical spatial clustering based algorithm to work out the optimal blending program. Meanwhile, Dewey code is introduced to increase resolution efficiency. Dewey code is used presented the points in hierarchy space, and the codes of every point can be adopted to compute the similarity of every two points in the measure criterion. Two clustering algorithms have been proposed. We agglomerate two points which are the closest to each other according to the similarity measure criterion in hierarchy space by algorithm AGHC. In DIHC, the whole dataset is divided into small parts through K-medios until there are N clusters and N is set by users. Tea attributes are quantified and the process of tea blending is standardized. This study enable tea blending to get rid of human experience, instead of intelligent approach. The results of tea blending in this article can be accurate due to the strict consolidation doctrine. That means we will be rational when we choose which tea to be blended in practice to satisfy customers’ demands. Appropriate tea will be blended by several kinds of tea with the study in this article. Finally, experiments on real data set demonstrate the solution of tea blending proposed in this paper is greatly improving work efficiency and economic benefits.



Similar content being viewed by others
References
Joliffe, L.: Chapter 6: The lure of tea: history, traditions and attractions. In: Hall, C.M., Sharples, L., Mitchell, R., Macionis, N. (eds.) Food Tourism Around the World, pp. 121–136. Routledge, London (2003)
Yongcun, Z.: Matching method and mastery of fire power of Oolong tea. China Tea Process. 3, 13–15 (1997)
Yongtai, L., Naishen, L.: Comprehensive analysis of tea sensory identification. Syst. Eng. Theory Pract. 35(6), 59–66 (1989)
Tong, H.R., Gong, Z.L.: Study on blending of made tea with mixture design. J. Tea Sci. 24(3), 207–211 (2004)
Yiping, L.: Blending techniques of finished tea baking embryo. Tea Sci. Technol. 2, 34–35 (1997)
Lu, S.: How to do a good job of finished tea match. China Tea 6, 39–40 (1981)
Xingming, H.: Blending technology of Kong Fu black tea. J. Tea Bus. 1, 35–36 (1995)
Guohai, W.: The practice of the roller blending machine in tea blending. Guangdong Tea 1, 31–32 (2003)
Hewei, G.: Design of the control system of tea evenly pushing machine based on PLC. Hubei Agric. Sci. 52(4), 933–936 (2013)
Zhiquan, W.: Application of vibrating machine in the process of tea blending. Hoisting Convey. Mach. 3, 66–67 (1981)
Hetao, Z.: Application of electronic technology in tea processing. Today Sci. Technol. 5, 9–9 (1995)
Xiangsheng, Y., Kaixin, Y.: On the mechanization of black tea blending. Tea Commun. 1, 47–48 (1990)
Tong, H.R., Gong, Z.L.: Study on blending of made tea with mixture design. J. Tea Sci. 03, 207–211 (2004)
Yiping, L., Xuemao, L.: Talking about the skills of blending the finished tea. Fujian Tea 1, 44–46 (1998)
Lingyi, L.: Discussion on tea blending. China Tea 2, 35 (1988)
Kang, C.: Key points of refining technology of high-grade refined baked green tea. Tea Sci. Technol. 3, 29–31 (1994)
Zheng, Y.: Technical measures of green tea refined baked processing of township tea factory. China Tea Process. 2, 21–22 (1994)
Qisong, S.: The design of tea blending production line of Yunnan tea export black tea. China Tea 4, 38–39 (1995)
Bingxuan, Z.: Pinions on the blending of finished tea. J. Tea Bus. 4, 32–33 (1985)
Caiyan, W., Zhuoneng, Z., Rongxi, L.: Method for matching oolong tea, CN 101897373 A (2010)
Ju, C., Wang, G.: Research and implementation of PTBDSS based on knowledge. J. Comput. Res. Dev. (1998)
Wensheng, X., Guangming, W., Chunhua, L.: Application of linear programming in tea blendin. Comput. Technol. Autom. 3, 61–64 (1995)
Liu, J.: Goal programming applied to seek to the best scheme of making up tea. Syst. Eng. Eng. Theory 3, 21–43 (1992)
Liu, C.: Tea blending method based on multi factor constraint, CN1742592. (2006)
Liu, C., Wu, L., Wang, G.: The implementation and application of the planning model of the coordination class based on the rule and multi factor constraints. J. Ind. Eng. Manag. 15(1), 50–54 (2001)
Chakrabarti, D., Faloutsos, C.: Graph mining: laws, generators, and algorithms. ACM. Comput. Surv. 38(1), 2 (2006)
Chakrabarti, D., Faloutsos, C., Zhan, Y.: Visualization of large networks with min-cut plots, a-plots and R-MAT. Int. J. Hum. Comput. Stud. 65(5), 434–445 (2007)
Newman, M.E.J.: The structure and function of complex networks. SIAM Rev. 45, 167–256 (2003)
Huan, J., Wang, W., Prins, J., Yang, J.: SPIN: Mining maximal frequent subgraphs from graph databases. In: Proceedings of KDD’04, pp. 581–586 (2004)
Wang, W., Wang, C., Zhu, Y., Shi, B., Pei, J., Yan, X., Han, J.: GraphMiner: a structural pattern-mining system for large disk based graph databases and its applications. In: Proceedings of SIGMOD’05, pp. 879–881 (2005)
Sun, J., Xie, Y., Zhang, H., Faloutsos, C.: Less is more: sparse graph mining with compact matrix decomposition. Stat. Anal. Data Min. 1(1), 6–22 (2008)
Xu, X., Yuruk, N., Feng, Z., Schweiger, T.A.J.: SCAN: astructural clustering algorithm for networks. In: Proceedings of KDD’07, pp 24–833 (2007)
Battista, G., Eades, P., Tamassia, R., Tollis, I.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, Upper Saddle River (1999)
Herman, I., Melancon, G., Marshall, M.S.: Graph visualization and navigation in information visualization: a survey. IEEE Trans. Vis. Comput. Graph. 6(1), 24–43 (2000)
Navlakha, S., Rastogi, R., Shrivastava, N.: Graph summarization with bounded error. In: Proceedings of SIGMOD’08, pp. 567–580 (2008)
Tian, Y., Hankins, R., Patel, J. M.: Efficient aggregation for graph summarization. In: Proceedings of SIGMOD’08, pp. 419–432 (2008)
Gil-Garcia, R., Badia-Contelles, J.M., Pons-Porrata, A.: A general framework for agglomerative hierarchical clustering algorithms. International Conference on Pattern Recognition. IEEE Computer Society, pp. 569–572 (2006)
Zhang, N., Tian, Y., Patel, J.M.: Discovery-driven graph summarization. Data Engineering (ICDE) (2010)
Han, J., Kamber, M., Pei, J.: Data Mining Concepts and Techniques. China Machine Press, Beijing (2001)
Mingxiu, D.: The Research and Application of Hierarchical Clustering Algorithm. Central South University (2009)
Kim, S.: Research on the Knowledge Discovery in Conceptual Hierarchy Knowledge Base Based on the Multiple-Level Association Rules. Tianjin University, Tianjin (2006)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Tie, J., Chen, W., Sun, C. et al. The application of agglomerative hierarchical spatial clustering algorithm in tea blending. Cluster Comput 22 (Suppl 3), 6059–6068 (2019). https://doi.org/10.1007/s10586-018-1813-z
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10586-018-1813-z