ACM Home Page
Please provide us with feedback. Feedback
Spectral clustering with inconsistent advice
Full text PdfPdf (391 KB)
Source ICML; Vol. 307 archive
Proceedings of the 25th international conference on Machine learning table of contents
Helsinki, Finland
Pages 152-159  
Year of Publication: 2008
ISBN:978-1-60558-205-4
Authors
Tom Coleman  The University of Melbourne, Victoria, Australia
James Saunderson  The University of Melbourne, Victoria, Australia
Anthony Wirth  The University of Melbourne, Victoria, Australia
Sponsors
: Yahoo!
: Xerox
IBM : IBM
: NSF
Microsoft Research : Microsoft Research
: Machine Learning Journal/Springer
: Pascal
: University of Helsinki
: Federation of Finnish Learned Societies
: Intel Corporation
: Google
: Helsinki Institute for Information Technology
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 53,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1390156.1390176
What is a DOI?

ABSTRACT

Clustering with advice (often known as constrained clustering) has been a recent focus of the data mining community. Success has been achieved incorporating advice into the k-means and spectral clustering frameworks. Although the theory community has explored inconsistent advice, it has not yet been incorporated into spectral clustering. Extending work of De Bie and Cristianini, we set out a framework for finding minimum normalised cuts, subject to inconsistent advice.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
Asuncion, A., & Newman, D. (2007). UCI machine learning repository.
 
3
 
4
 
5
 
6
De Bie, T., Suykens, J., & De Moor, B. (2004). Learning from general label constraints. Joint IAPR International Workshops on Structural, Syntactic, and Statistical Pattern Recognition, 671--679.
 
7
 
8
Kamvar, S., Klein, D., & Manning, C. (2003). Spectral learning. Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI-2003), 561--566.
 
9
 
10
 
11
Xing, E., & Jordan, M. (2003). On Semidefinite Relaxation for Normalized K-cut and Connections to Spectral Clustering. Computer Science Division, University of California.
 
12
Xing, E., Ng, A., Jordan, M., & Russell, S. (2003). Distance metric learning, with application to clustering with side-information. Advances in Neural Information Processing Systems, 15, 505--512.
 
13
Yu, S., & Shi, J. (2001). Grouping with Bias. Carnegie Mellon University, the Robotics Institute.


Collaborative Colleagues:
Tom Coleman: colleagues
James Saunderson: colleagues
Anthony Wirth: colleagues