From: Advancing community detection using Keyword Attribute Search
Symbol | Meaning |
---|---|
G(V, E) | An undirected graph with set of vertices V and set of edges E |
\(\lambda\) | A set of attributes for set of vertices V |
q | keyword or query to be searched on attributed graph G |
\(deg_{G}(V)\) | The degree of vertex V in G |
L(X(q)) | The length of the set of attribute X for vertex q |
\(G[S']\) | The largest connected subgraph of G such that \(q \in G[S']\), and \(S \subset X(v)\) |
Sim(q1, q2) | Jaccard Similarity Index to measure similarity between q1 and q2 |
\(\theta _{c}\) | Minimum threshold constant for similarity between q1 and q2 |
\(\theta _{w}\) | Minimum threshold constant for average weight of the attributes shared between q1 and q2 |
\(\theta _{d}\) | Maximum threshold constant for geodesic distance between q1 and q2 |
\(W_{v}\) | Minimum threshold constant for Node-weight on attribute type-value pairs |
\(W_{e}\) | Minimum threshold constant for Edge-weight on attribute type-value pairs |
GD(q1, q2) | Shortest path length or geodesic distance between q1 and q2 |