Consensus clustering has emerged as an important elaboration of the classical clustering problem. Consensus clustering, also called aggregation of clustering (or partitions), refers to the situation in which a number of different (input) clusterings have been obtained for a particular dataset and it is desired to find a single (consensus) clustering which is a better fit in some sense than the existing clusterings. Consensus clustering is thus the problem of reconciling clustering information about the same data set coming from different sources or from different runs of the same algorithm. When cast as an optimization problem, consensus clustering is known as median partition, and has been shown to be NP-complete.
The M-tree is an index structure that can be used for the efficient resolution of similarity queries on complex objects to be compared using an arbitrary metric
The FOSS in Research and Student Innovation Miniconf brings together researchers and students with an active interest in Free and Open Source Software with the broader Linux.conf.au community to highlight exciting work taking place within the often esoteric world of academia and educational institutions.
The Miniconf is part of Linux.conf.au 2011, being held at the QUT Gardens Point Campus in Brisbane, Queensland in January.
Topics are split into two streams: FOSS in Research, which invites presentations on research relating to Free and Open Source Software; and Student Innovation, which explores new and exciting work in the FOSS world conducted by students. Presentations may be proposed in a 25-minute talk format (20 minutes talk + 5 minutes discussion).
M. Balcan, A. Blum, и A. Gupta. SODA '09: Proceedings of the Nineteenth Annual ACM -SIAM Symposium on Discrete Algorithms, стр. 1068--1077. Philadelphia, PA, USA, Society for Industrial and Applied Mathematics, (2009)
J. Kamps, и M. Koolen. WSDM '09: Proceedings of the Second ACM International Conference on Web Search and Data Mining, стр. 232--241. New York, NY, USA, ACM, (2009)
D. Bollegala, Y. Matsuo, и M. Ishizuka. WSDM '09: Proceedings of the Second ACM International Conference on Web Search and Data Mining, стр. 104--113. New York, NY, USA, ACM, (2009)
S. Overell, B. Sigurbjörnsson, и R. van Zwol. WSDM '09: Proceedings of the Second ACM International Conference on Web Search and Data Mining, стр. 64--73. New York, NY, USA, ACM, (2009)
M. Koolen, G. Kazai, и N. Craswell. WSDM '09: Proceedings of the Second ACM International Conference on Web Search and Data Mining, стр. 44--53. New York, NY, USA, ACM, (2009)
C. Karande, K. Chellapilla, и R. Andersen. WSDM '09: Proceedings of the Second ACM International Conference on Web Search and Data Mining, стр. 272--281. New York, NY, USA, ACM, (2009)
D. Ramage, P. Heymann, C. Manning, и H. Garcia-Molina. WSDM '09: Proceedings of the Second ACM International Conference on Web Search and Data Mining, стр. 54--63. New York, NY, USA, ACM, (2009)