WFSM-MaxPWS: An Efficient Approach for Mining Weighted Frequent Subgraphs from Edge-Weighted Graph Databases

2018 ◽  
pp. 664-676 ◽  
Author(s):  
Md. Ashraful Islam ◽  
Chowdhury Farhan Ahmed ◽  
Carson K. Leung ◽  
Calvin S. H. Hoi
Keyword(s):  
Weighted Graph ◽  
Graph Databases ◽  
Efficient Approach ◽  
Frequent Subgraphs

scholarly journals K-Graph: Knowledgeable Graph for Text Documents

2021 ◽  
Vol 51 (1) ◽  
pp. 73-89
Author(s):  
Varsha Mittal ◽  
Durgaprasad Gangodkar ◽  
Bhaskar Pant
Keyword(s):  
Structural Information ◽  
Low Complexity ◽  
Semantic Knowledge ◽  
Access Time ◽  
Graph Databases ◽  
Text Documents ◽  
Memory Overhead ◽  
Frequent Subgraphs ◽  
Real World Datasets ◽  
Different Levels

Abstract Graph databases are applied in many applications, including science and business, due to their low-complexity, low-overheads, and lower time-complexity. The graph-based storage offers the advantage of capturing the semantic and structural information rather than simply using the Bag-of-Words technique. An approach called Knowledgeable graphs (K-Graph) is proposed to capture semantic knowledge. Documents are stored using graph nodes. Thanks to weighted subgraphs, the frequent subgraphs are extracted and stored in the Fast Embedding Referral Table (FERT). The table is maintained at different levels according to the headings and subheadings of the documents. It reduces the memory overhead, retrieval, and access time of the subgraph needed. The authors propose an approach that will reduce the data redundancy to a larger extent. With real-world datasets, K-graph’s performance and power usage are threefold greater than the current methods. Ninety-nine per cent accuracy demonstrates the robustness of the proposed algorithm.

Mining frequent subgraphs over uncertain graph databases under probabilistic semantics

2012 ◽  
Vol 21 (6) ◽  
pp. 753-777 ◽  
Author(s):  
Jianzhong Li ◽  
Zhaonian Zou ◽  
Hong Gao
Keyword(s):  
Graph Databases ◽  
Uncertain Graph ◽  
Probabilistic Semantics ◽  
Frequent Subgraphs

An Efficient Approach for Mining Frequent Subgraphs

2017 ◽  
pp. 486-492 ◽  
Author(s):  
Tahira Alam ◽  
Sabit Anwar Zahin ◽  
Md. Samiullah ◽  
Chowdhury Farhan Ahmed
Keyword(s):  
Efficient Approach ◽  
Frequent Subgraphs

An efficient approach to lattice-based fixed-rate entropy-coded vector quantization

2003 ◽  
Vol 14 (2) ◽  
pp. 141-147
Author(s):  
Sasan Nikneshan ◽  
And Amir Keyvan Khandani
Keyword(s):  
Vector Quantization ◽  
Fixed Rate ◽  
Efficient Approach
Sign in / Sign up

Export Citation Format

Share Document