Discovering Communities of Similar R&D Projects

Martin Víta

2015

Abstract

Datasets about research projects contain knowledge that is valuable for several types of subjects working in the R&D field – including innovative companies, research institutes and universities even individual researchers or research teams, as well as funding providers. The main goal of this paper is to introduce a software tool based on a reusable methodology that allows us to deal with similarity of projects in order to group them and provide a deeper insight into a structure of considered set of projects in a visual way. In our approach we use several concepts developed in social network analysis.

References

  1. Bonacich, P. (1972). Factoring and weighting approaches to status scores and clique identification. Journal of Mathematical Sociology, 2(1):113-120.
  2. Brazdil, P., Trigo, L., Cordeiro, J., Sarmento, R., and Valizadeh, M. (2015). Affinity mining of documents sets via network analysis, keywords and summaries. Oslo Studies in Language, 7(1).
  3. Combe, D., Largeron, C., Egyed-Zsigmond, E., and Géry, M. (2010). A comparative study of social network analysis tools. In International Workshop on Web Intelligence and Virtual Enterprises, volume 2, page 1.
  4. Feldman, R. and Sanger, J. (2007). The Text Mining Handbook: Advanced Approaches in Analyzing Unstructured Data. Cambridge University Press.
  5. Ma, J., Xu, W., Sun, Y.-h., Turban, E., Wang, S., and Liu, O. (2012). An ontology-based text-mining method to cluster proposals for research project selection. Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Transactions on, 42(3):784-790.
  6. Magerman, T., Van Looy, B., and Song, X. (2010). Exploring the feasibility and accuracy of latent semantic analysis based text mining techniques to detect similarity between patent documents and scientific publications. Scientometrics, 82(2):289-306.
  7. Mikolov, T., Chen, K., Corrado, G., and Dean, J. (2013). Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781.
  8. Pons, P. and Latapy, M. (2006). Computing communities in large networks using random walks. J. Graph Algorithms Appl., 10(2):191-218.
  9. Rehurek, R. (2008). Semantic-based plagiarism detection.
  10. Ruhnau, B. (2000). Eigenvector-centralitya nodecentrality? Social networks, 22(4):357-365.
  11. Trigo, L. and Brazdil, P. (2014). Affinity analysis between researchers using text mining and differential analysis of graphs. ECML/PKDD 2014 PhD session Proceedings, pages 169-176.
  12. Wirth, R. and Hipp, J. (2000). Crisp-dm: Towards a standard process model for data mining. In Proceedings of the 4th International Conference on the Practical Applications of Knowledge Discovery and Data Mining, pages 29-39. Citeseer.
Download


Paper Citation


in Harvard Style

Víta M. (2015). Discovering Communities of Similar R&D Projects . In Proceedings of the 7th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management - Volume 3: KITA, (IC3K 2015) ISBN 978-989-758-158-8, pages 460-465. DOI: 10.5220/0005663004600465


in Bibtex Style

@conference{kita15,
author={Martin Víta},
title={Discovering Communities of Similar R&D Projects},
booktitle={Proceedings of the 7th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management - Volume 3: KITA, (IC3K 2015)},
year={2015},
pages={460-465},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005663004600465},
isbn={978-989-758-158-8},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 7th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management - Volume 3: KITA, (IC3K 2015)
TI - Discovering Communities of Similar R&D Projects
SN - 978-989-758-158-8
AU - Víta M.
PY - 2015
SP - 460
EP - 465
DO - 10.5220/0005663004600465