The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Some Other Applications in Community Graph under the Preview of Social Graph Using Graph-Mining Techniques
|
Author(s): Bapuji Rao (iNurture Education Solutions Private Limited, India), Sasmita Mishra (IGIT, India)and Saroja Nanda Mishra (IGIT, India)
Copyright: 2017
Pages: 61
Source title:
Web Data Mining and the Development of Knowledge-Based Decision Support Systems
Source Author(s)/Editor(s): G. Sreedhar (Rashtriya Sanskrit Vidyapeetha (Deemed University), India)
DOI: 10.4018/978-1-5225-1877-8.ch014
PurchaseView on the publisher's website for pricing and purchasing information.
|
Abstract
The retrieval of sub-graph from a large graph in structured data mining is one of the fundamental tasks for analyze. Visualization and analyze large community graph are challenging day by day. Since a large community graph is very difficult to visualize, so compression is essential. To study a large community graph, compression technique may be used for compression of community graph. There should not be any loss of information or knowledge while compressing the community graph. Similarly to extract desired knowledge of a particular sub-graph from a large community graph, then the large community graph needs to be partitioned into smaller sub-community graphs. The partition aims at the edges among the community members of dissimilar communities in a community graph. Sometimes it is essential to compare two community graphs for similarity which makes easier for mining the reliable knowledge from a large community graph. Once the similarity is done then the necessary mining of knowledge can be extracted from only one community graph rather than from both which leads saving of time.
Related Content
Okure Udo Obot, Kingsley Friday Attai, Gregory O. Onwodi.
© 2023.
28 pages.
|
Thomas M. Connolly, Mario Soflano, Petros Papadopoulos.
© 2023.
29 pages.
|
Dmytro Dosyn.
© 2023.
26 pages.
|
Jan Kalina.
© 2023.
21 pages.
|
Avishek Choudhury, Mostaan Lotfalian Saremi, Estfania Urena.
© 2023.
20 pages.
|
Yuanying Qu, Xingheng Wang, Limin Yu, Xu Zhu, Wenwu Wang, Zhi Wang.
© 2023.
26 pages.
|
Yousra Kherabi, Damien Ming, Timothy Miles Rawson, Nathan Peiffer-Smadja.
© 2023.
10 pages.
|
|
|