[vc_empty_space][vc_empty_space]
Knowledge-based graph compression using graph property on Yago
Wahyudia, Khodra M.L.a, Prihatmanto A.S.a, Machbub C.a
a School of Electrical Engineering and Informatics, Institut Teknologi Bandung, Bandung, Indonesia
[vc_row][vc_column][vc_row_inner][vc_column_inner][vc_separator css=”.vc_custom_1624529070653{padding-top: 30px !important;padding-bottom: 30px !important;}”][/vc_column_inner][/vc_row_inner][vc_row_inner layout=”boxed”][vc_column_inner width=”3/4″ css=”.vc_custom_1624695412187{border-right-width: 1px !important;border-right-color: #dddddd !important;border-right-style: solid !important;border-radius: 1px !important;}”][vc_empty_space][megatron_heading title=”Abstract” size=”size-sm” text_align=”text-left”][vc_column_text]© 2017 IEEE.It is common to find graphs with millions of nodes and edges in social networks, computer network, and knowledge bases. A number of edges and nodes that make the computational complexity becomes large beside it the number of nodes and edges that are not important difficult for us to make the process of patterning graph. We propose a compression method to eliminate unimportant nodes and edges becomes a property of the important nodes. We developed an algorithm graph property compression (GPC) to compress the compression property on the yago knowledge-based. The results of research conducted on yago compression can reduce a 42.45 % node and 47.66% edge. It is effective to reduce the size of the graph primarily unimportant node and edge.[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Author keywords” size=”size-sm” text_align=”text-left”][vc_column_text]Compression methods,Compression properties,graph,Graph compressions,Graph properties,Knowledge based,Knowledge basis,yago[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Indexed keywords” size=”size-sm” text_align=”text-left”][vc_column_text]graph,graph compression,graph property,yago[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Funding details” size=”size-sm” text_align=”text-left”][vc_column_text]Acknowledgments This research is partially supported by a scholarship granted by LPDP Indonesia. and partially supported by a research grant kemenristekdikti.[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”DOI” size=”size-sm” text_align=”text-left”][vc_column_text]https://doi.org/10.1109/ICSITech.2017.8257097[/vc_column_text][/vc_column_inner][vc_column_inner width=”1/4″][vc_column_text]Widget Plumx[/vc_column_text][/vc_column_inner][/vc_row_inner][/vc_column][/vc_row][vc_row][vc_column][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][/vc_column][/vc_row]