Abstract
We propose a method of using clustering techniques to partition a set of orders. We define the term order as a sequence of objects that are sorted according to some property, such as size, preference, or price. These orders are useful for, say, carrying out a sensory survey. We propose a method called the k-o’means method, which is a modified version of a k-means method, adjusted to handle orders. We compared our method with the traditional clustering methods, and analyzed its characteristics. We also applied our method to a questionnaire survey data on people’s preferences in types of sushi (a Japanese food).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Everitt, B.S.: Cluster Analysis, 3rd edn. Edward Arnold, London (1993)
Jain, A.K., Dubes, R.C.: Algorithms for Clustering Data. Prentice Hall, Englewood Cliffs (1988)
Osgood, C.E., Suci, G.J., Tannenbaum, P.H.: The Measurement of Meaning. University of Illinois Press, Urbana (1957)
Nakamori,Y.: Kansei data Kaiseki. Morikita Shuppan Co., Ltd. (2000) (in Japanese).
Cadez, I.V., Gaffney, S., Smyth, P.: A general probabilistic framework for clustering individuals and objects. In: Proc. of The 6th Int’l Conf. on Knowledge Discovery and Data Mining, pp. 140–149 (2000)
Ramoni, M., Sebastiani, P., Cohen, P.: Bayesian clustering by dynamics. Machine Learning 47, 91–121 (2002)
Keogh, E.J., Pazzani, M.J.: An enhanced representation of time series which allows fast and accurate classification, clustering and relevance feedback. In: Proc. of The 4th Int’l Conf. on Knowledge Discovery and Data Mining, pp. 239–243 (1998)
Thurstone, L.L.: A law of comparative judgment. Psychological Review 34, 273–286 (1927)
Cohen, W.W., Schapire, R.E., Singer, Y.: Learning to order things. Journal of Artificial Intelligence Research 10, 243–270 (1999)
Joachims, T.: Optimizing search engines using clickthrough data. In: Proc. of The 8th Int’l Conf. on Knowledge Discovery and Data Mining, pp. 133–142 (2002)
Kamishima, T., Akaho, S.: Learning from order examples. In: Proc. of The IEEE Int’l Conf. on Data Mining, pp. 645–648 (2002)
Kazawa, H., Hirao, T., Maeda, E.: Order SVM: A kernel method for order learning based on generalized order statistic. The IEICE Trans. on Information and Systems, pt 2 J86-D-II, 926–933 (2003) (in Japanese)
Mannila, H., Meek, C.: Global partial orders from sequential data. In: Proc. of The 6th Int’l Conf. on Knowledge Discovery and Data Mining, pp. 161–168 (2000)
Sai, Y., Yao, Y.Y., Zhong, N.: Data analysis and mining in ordered information tables. In: Proc. of The IEEE Int’l Conf. on Data Mining, pp. 497–504 (2001)
Kendall, M., Gibbons, J.D.: Rank Correlation Methods, 5th edn. Oxford University Press, Oxford (1990)
Hohle, R.H.: An empirical evaluation and comparison of two models for discriminability scales. Journal of Mathematical Psychology 3, 173–183 (1966)
Huang, Z.: Extensions to the k-means algorithm for clustering large data with categorical values. Journal of Data Mining and Knowledge Discovery 2, 283–304 (1998)
Kamishima, T., Motoyoshi, F.: Learning from cluster examples. Machine Learning (2003) (in press).
Milligan, G.W., Cooper, M.C.: An examination of procedures for determining the number of clusters in a data set. Psychometrika 50, 159–179 (1985)
Kamishima, T.: Nantonac collaborative filtering: Recommendation based on order responses. In: Proc. of The 9th Int’l Conf. on Knowledge Discovery and Data Mining (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kamishima, T., Fujiki, J. (2003). Clustering Orders. In: Grieser, G., Tanaka, Y., Yamamoto, A. (eds) Discovery Science. DS 2003. Lecture Notes in Computer Science(), vol 2843. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39644-4_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-39644-4_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20293-6
Online ISBN: 978-3-540-39644-4
eBook Packages: Springer Book Archive