Search results
- 1.0502857 - ÚMG 2019 RIV US eng J - Journal Article
Bartoň, Tomáš - Bruna, T. - Kordík, P.
Chameleon 2: An Improved Graph-Based Clustering Algorithm.
ACM Transactions on Knowledge Discovery from Data. Roč. 13, č. 1 (2019), č. článku 10. ISSN 1556-4681. E-ISSN 1556-472X
R&D Projects: GA MŠMT LO1220
Institutional support: RVO:68378050
Keywords : Cluster analysis * clustering * graph clustering * pattern recognition
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Impact factor: 2.010, year: 2019
Permanent Link: http://hdl.handle.net/11104/0294737 - 2.0405530 - UIVT-O 330908 US eng V - Research Report
Šíma, Jiří - Schaeffer, S.E.
On the NP-Completeness of Some Graph Cluster Measures.
Cornell University, 2005. 9 s. arXiv.org e-Print archive, cs.CC/0506100.
R&D Projects: GA MŠMT 1M0545
Keywords : graph clustering * conductance * density * cluster editing * NP-completeness
Subject RIV: BA - General Mathematics
http://arxiv.org/pdf/cs.CC/0506100
Permanent Link: http://hdl.handle.net/11104/0125688 - 3.0384813 - ÚI 2013 RIV DE eng C - Conference Paper (international conference)
Kohout, J. - Neruda, Roman
Exploration and Exploitation Operators for Genetic Graph Clustering Algorithm.
Foundations of Intelligent Systems. Berlin: Springer, 2012 - (Chen, L.; Felfernig, A.; Liu, J.; Ras, Z.), s. 87-92. Lecture Notes in Computer Science, 7661. ISBN 978-3-642-34623-1. ISSN 0302-9743.
[ISMIS 2012. International Symposium on Methodologies for Intelligent System /20./. Macau (MO), 05.12.2012-07.12.2012]
R&D Projects: GA ČR GAP202/11/1368
Institutional support: RVO:67985807
Keywords : genetic algorithms * graph clustering * social networks
Subject RIV: IN - Informatics, Computer Science
Permanent Link: http://hdl.handle.net/11104/0007334File Download Size Commentary Version Access a0384813.pdf 0 207.1 KB Publisher’s postprint require - 4.0339971 - ÚI 2010 RIV DE eng C - Conference Paper (international conference)
Šíma, Jiří - Schaeffer, S.E.
On the NP-Completeness of Some Graph Cluster Measures.
SOFSEM 2006: Theory and Practice of Computer Science. Berlin: Springer, 2006 - (Wiedermann, J.; Tel, G.; Pokorný, J.; Bieliková, M.; Štuller, J.), s. 530-537. Lecture Notes in Computer Science, 3831. ISBN 3-540-31198-X.
[SOFSEM 2006. Conference on Current Trends in Theory and Practice of Computer Science /32./. Měřín (CZ), 21.01.2006-27.01.2006]
R&D Projects: GA MŠMT(CZ) 1M0545
Grant - others:Academy of Finland(FI) 126235
Institutional research plan: CEZ:AV0Z10300504
Keywords : graph clustering * conductance * density * cluster editing * NP-completeness
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0183326File Download Size Commentary Version Access 0339971.pdf 0 323.7 KB Author´s preprint open-access - 5.0048323 - ÚI 2007 RIV US eng M - Monography Chapter
Húsek, Dušan - Pokorný, J. - Řezanková, H. - Snášel, V.
Data Clustering: From Documents to the Web.
[Shlukování dat: Od dokumentů k Webu.]
Web data Management Practices. Emerging Techniques and Technologies. Hershey: Idea Group Publishing, 2007 - (Vakali, A.; Pallis, G.), s. 1-33. ISBN 1-59904-229-0
R&D Projects: GA AV ČR 1ET100300419; GA ČR GA201/05/0079
Institutional research plan: CEZ:AV0Z10300504
Keywords : cluster analysis * clustering of documents * graph clustering * neural networks
Subject RIV: BB - Applied Statistics, Operational Research
Permanent Link: http://hdl.handle.net/11104/0138981