publication . Research . Preprint . 2016

A Minimum Spanning Tree Representation of Anime Similarities

Canggih Puspo Wibowo;
  • Published: 07 Jun 2016
In this work, a new way to represent Japanese animation (anime) is presented. We applied a minimum spanning tree to show the relation between anime. The distance between anime is calculated through three similarity measurements, namely crew, score histogram, and topic similarities. Finally, the centralities are also computed to reveal the most significance anime. The result shows that the minimum spanning tree can be used to determine the similarity anime. Furthermore, by using centralities calculation, we found some anime that are significant to others.
free text keywords: Computer Science - Information Retrieval, Computer Science - Discrete Mathematics
17 references, page 1 of 2

[1] I. Herman, G. Melancon, and M. S. Marshall, “Graph visualization and navigation in information visualization: A survey,” IEEE Transactions on Visualization and Computer Graphics, vol. 6, pp. 24-43, Jan 2000.

[2] L. Moncla, M. Gaio, J. Nogueras-Iso, and S. Mustire, “Reconstruction of itineraries from annotated text with an informed spanning tree algorithm,” International Journal of Geographical Information Science, vol. 30, no. 6, pp. 1137-1160, 2016.

[3] M. K. Murmu, “A distributed approach to construct minimum spanning tree in cognitive radio networks,” Procedia Computer Science, vol. 70, pp. 166 - 173, 2015. Proceedings of the 4th International Conference on Eco-friendly Computing and Communication Systems. [OpenAIRE]

[4] A. Crobe, M. Demuru, L. Didaci, G. L. Marcialis, and M. Fraschini, “Minimum spanning tree and k -core decomposition as measure of subject-specific eeg traits,” Biomedical Physics and Engineering Express, vol. 2, no. 1, p. 017001, 2016. [OpenAIRE]

[5] V. MAICAN, “Minimum spanning tree algorithm on mapreduce onechip architecture,” Romanian Journal of Information Science and Technology, vol. 18, no. 2, pp. 126-143, 2015.

[6] S. L. Gan and M. A. Djauhari, “New york stock exchange performance: evidence from the forest of multidimensional minimum spanning trees,” Journal of Statistical Mechanics: Theory and Experiment, vol. 2015, no. 12, p. P12005, 2015.

[7] M. Vlachos and D. Svonava, “Recommendation and visualization of similar movies using minimum spanning dendrograms,” Information Visualization, vol. 12, no. 1, pp. 85-101, 2013.

[8] N. Jakob, S. H. Weber, M.-C. Mller, and I. Gurevych, “Beyond the stars: Exploiting free-text user reviews to improve the accuracy of movie recommendations,” in Proceedings of the 1st international CIKM workshop on Topic-sentiment analysis for mass opinion, pp. 57-64, 2009.

[9] Y. Shi, M. Larson, and A. Hanjalic, “Mining mood-specific movie similarity with matrix factorization for context-aware recommendation,” in Proceedings of the workshop on context-aware movie recommendation, pp. 34-40, ACM, 2010.

[10] G. Takacs, I. Pilaszy, B. Nemeth, and D. Tikk, “On the gravity recommendation system,” in Proceedings of KDD Cup Workshop at SIGKDD07, 13th ACM Int. Conf. on Knowledge Discovery and Data Mining, pp. 22-30, 2007.

[11] M. Fleischman and E. Hovy, “Recommendations without user preferences: a natural language processing approach,” in Proceedings of the 8th international conference on Intelligent user interfaces, pp. 242-244, ACM, 2003.

[12] J. Nieminen, “On the centrality in a graph,” Scandinavian journal of psychology, vol. 15, no. 1, pp. 332-336, 1974. [OpenAIRE]

[13] P. Bonacich, “Power and centrality: A family of measures,” American journal of sociology, pp. 1170-1182, 1987. [OpenAIRE]

[14] L. C. Freeman, “A set of measures of centrality based on betweenness,” Sociometry, pp. 35-41, 1977.

[15] L. C. Freeman, “Centrality in social networks conceptual clarification,” Social networks, vol. 1, no. 3, pp. 215-239, 1978.

17 references, page 1 of 2
Powered by OpenAIRE Research Graph
Any information missing or wrong?Report an Issue