Mining on the Basis of Similarity in Graph and Image Data

3Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Data sets emanating from number of engineering and physical world realm can be depicted as the mutual or one way interaction within a graph like connected structure, in a quite common, robust and relevant way. This is precisely a real context in social graphs, notably the accustomed current advances in navigation in map based technologies, vision on biometrics and various web based application advances towards a disparate range of emerging social graphs and other networks. Careful scrutiny of such networks precisely results in diagnosis of potentially useful and interesting pattern in networks as well as their relative and combined growth. Some social structures of graphs and networks displays the robust commutable behaviour for any community,represented as graph. That is why an precise research plan is exits to describe and analyse the communities within the graph in the domain of community detection. Vast majority of graph based application also resilient in image and vision based application and mining in the field of geoinformation engineering and neural computation. In this paper we studied the graph based approaches for classification and clustering in graph based datasets subsequently we applied the approach in coloured images and identified the clustering trends in both types of data. Our study is completely uncovering the complex nature of graph based trend detection.

Cite

CITATION STYLE

APA

Srivastava, V., & Biswas, B. (2019). Mining on the Basis of Similarity in Graph and Image Data. In Communications in Computer and Information Science (Vol. 956, pp. 193–203). Springer Verlag. https://doi.org/10.1007/978-981-13-3143-5_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free