Finding Outlying Items in Sets of Partial Rankings

  • Antti Ukkonen
  • Heikki Mannila
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4702)


Partial rankings are totally ordered subsets of a set of items. For example, the sequence in which a user browses through different parts of a website is a partial ranking. We consider the following problem. Given a set D of partial rankings, find items that have strongly different status in different parts of D. To do this, we first compute a clustering of D and then look at items whose average rank in the cluster substantially deviates from its average rank in D. Such items can be seen as those that contribute the most to the differences between the clusters. To test the statistical significance of the found items, we propose a method that is based on a MCMC algorithm for sampling random sets of partial rankings with exactly the same statistics as D. We also demonstrate the method on movie rankings and gene expression data.


Random Data Partial Ranking MCMC Algorithm Swap Operation Pair Order 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Cobb, G., Chen, Y.: An application of markov chain monte carlo to community ecology. American Mathematical Monthly 110, 264–288 (2003)CrossRefMathSciNetGoogle Scholar
  2. 2.
    Gionis, A., Mannila, H., Mielikäinen, T., Tsaparas, P.: Assessing data mining results via swap randomization. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 167–176. ACM Press, New York (2006)CrossRefGoogle Scholar
  3. 3.
    Kamishima, T., Akaho, S.: Efficient clustering for orders. In: ICDMW 2006. Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops, pp. 274–278. IEEE Computer Society Press, Los Alamitos (2006)Google Scholar
  4. 4.
    Ryser, H.J.: Combinatorial properties of matrices of zeros and ones. Canad. J. Math. 9, 371–377 (1957)MATHMathSciNetGoogle Scholar
  5. 5.
    Scherf, U., Ross, D.T., Waltham, M., Smith, L.H., Lee, J.K., Tanabe, L., Kohn, K.W., Reinhold, W.C., Myers, T.G., TAndrews, D., Scudiero, D.A., Eisen, M.B., Sausville, E.A., Pommier, Y., Botstein, D., Brown, P.O., Weinstein, J.N.: A gene expression database for the molecular pharmacology of cancer. Nature Genetics 24(3), 236–244 (2000)CrossRefGoogle Scholar
  6. 6.
    Ukkonen, A., Mannila, H.: Finding representative sets of bucket orders from partial rankings (submitted for review)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Antti Ukkonen
    • 1
    • 3
  • Heikki Mannila
    • 1
    • 2
    • 3
  1. 1.Helsinki University of Technology 
  2. 2.University of Helsinki 
  3. 3.Helsinki Institute for Information Technology 

Personalised recommendations