Spectral clustering in multi-agent systems

Knowledge and Information Systems

Volumn 25, Issue 3, 2010, Pages 607-622

  Takacs, Balint ^a   Demiris, Yiannis ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Multi agent systems; Plan extraction; Plan recognition; Spatio temporal data mining; Spectral clustering

Indexed keywords

COMPUTER GAMES; DATA MINING; ITERATIVE METHODS; K-MEANS CLUSTERING;

PARAMETER SPACES; PLAN EXTRACTION; PLAN RECOGNITION; SAMPLING FREQUENCIES; SPATIAL POSITIONS; SPATIO-TEMPORAL DATA MINING; SPECTRAL CLUSTERING; TEMPORAL SEGMENTATIONS;

MULTI AGENT SYSTEMS;

EID: 78649518096     PISSN: 02191377     EISSN: 02193116     Source Type: Journal    
DOI: 10.1007/s10115-009-0272-5     Document Type: Article

References (26)

1. Assent I, Krieger R, Glavic B, Seidl T (2008) Clustering multidimensional sequences in spatial and temporal databases. Knowl Inf Syst 16(1):29-51. doi:10.1007/s10115-007-0121-3
2. Bach FR, Jordan MI (2006) Learning spectral clustering, with application to speech separation. J Mach Learn Res 7:1963-2001
3. Bengio Y, Delalleau O, Le Roux N, Paiement J-F, Vincent P, Ouimet M (2004) Learning eigenfunctions links spectral embedding and kernel PCA. Neural Comput 16(10):2197-2219
4. Chan J, Bailey J, Leckie C (2008) Discovering correlated spatio-temporal changes in evolving graphs. Knowl Inf Syst 16(1):53-96. doi:10.1007/s10115-007-0117-z
5. Fischer I, Poland J (2005) Amplifying the block matrix structure for spectral clustering. In: Proceedings of the 14th annual machine learning conference of Belgium and the Netherlands, pp 21-28
6. Goyal VK, Vetterli M (1998) Block transform adaptation by stochastic gradient descent. In: IEEE digital signal processing workshop, Bryce Canyon, UT, August, p 75
7. Ham J, Ahn I, Lee D (2006) Learning a manifold-constrained map between image sets: applications to matching and pose estimation. In: Proceedings of the 2006 IEEE Computer Society conference on computer vision and pattern recognition, vol 1. IEEE Computer Society, Washington, pp 817-824
8. Hmlinen W (2009) StatApriori: an efficient algorithm for searching statistically significant association rules. Knowl Inf Syst. doi:10.1007/s10115-009-0229-8
9. Hubert L, Arabie P (1985) Comparing partitions. J Classification 2(1):193-218
10. Jenkins OC, Mataric MJ (2004) A spatio-temporal extension to isomap nonlinear dimension reduction. In: Proceedings of ICML, Banff, Canada, 4-8 July 2004. ACM, New York, pp 441-448
11. Lafon S, Keller Y, Coifman RR (2006) Data fusion and multicue data matching by diffusion maps. IEEE Trans Pattern Anal Mach Intell 28(11):1784-1797
12. Mahadevan S, Maggioni M (2006) Proto-value functions: a Laplacian framework for learning representation and control in Markov decision processes. Technical Report 2006-35, July 2006
13. Newman MEJ (2006) Modularity and community structure in networks. Proc Natl Acad Sci 103(23):8577-8582
14. Ng A, Jordan M,Weiss Y (2002) On spectral clustering: analysis and an algorithm. In: Advances in neural information processing systems 14. MIT Press, Cambridge, p 849
15. Papapetrou P, Kollios G, Sclaroff S, Gunopulos D (2009) Mining frequent arrangements of temporal intervals. Knowl Inf Syst. doi:10.1007/s10115-009-0196-0
16. Park J, Zha H, Kasturi R (2004) Spectral clustering for robust motion segmentation. In: Lecture notes in computer science, pp 390-401
17. Porikli F (2005) Ambiguity detection by fusion and conformity: a spectral clustering approach. In: International conference on integration of knowledge intensive multi-agent systems, 18-21 April 2005, pp 366-372
18. Ruan J, Zhang W (2007) An efficient spectral algorithm for network community discovery and its applications to biological and social networks. In: Proceedings of IEEE ICDM-07, Omaha, NE, USA, 28-31 October 2007
19. Saul LK, Weinberger KQ, Ham JH, Sha F, Lee DD (2006) Semisupervised learning. In: Spectral methods for dimensionality reduction. MIT Press, Cambridge
20. Shi J, Malik J (2000) Normalized cuts and image segmentation. IEEE Trans Pattern Anal Mach Intell 22(8):888-905
21. Şimşek Ö, Wolfe AP, Barto AG (2005) Identifying useful subgoals in reinforcement learning by local graph partitioning. In: Proceedings of ICML, vol 119 of ACMinternational conference proceeding series, pp 816-823
22. Sugar CA, James GM (2003) Finding the number of clusters in a dataset. J Am Stat Assoc 98(463): 750-763
23. Yuan J, Zhang B, Lin F (2005) Graph partition model for robust temporal data segmentation. In: Ho TB, Cheung D, Liu H (eds) Proceedings of PAKDD, number 3518 in LNAI. Springer-Verlag, Berlin, pp 758-763
24. Zelnik-Manor L, Irani M (2006) Statistical analysis of dynamic actions. IEEE Trans Pattern Anal Mach Intell 28(9):1530-1535
25. Zelnik-Manor L, Perona P (2004) Self-tuning spectral clustering. Adv Neural Inf Process Syst 17 (1601-1608):16
26. Zivkovic Z, Bakker B, Krose B (2006) Hierarchical map building and planning based on graph partitioning. In: IEEE international conference on robotics and automation, pp 803-809