A survey of community search over big graphs
With the rapid development of information technologies, various big graphs are prevalent in
many real applications (eg, social media and knowledge bases). An important component of …
many real applications (eg, social media and knowledge bases). An important component of …
Graph summarization methods and applications: A survey
While advances in computing resources have made processing enormous amounts of data
possible, human ability to identify patterns in such data has not scaled accordingly. Efficient …
possible, human ability to identify patterns in such data has not scaled accordingly. Efficient …
Poirot: Aligning attack behavior with kernel audit records for cyber threat hunting
Cyber threat intelligence (CTI) is being used to search for indicators of attacks that might
have compromised an enterprise network for a long time without being discovered. To have …
have compromised an enterprise network for a long time without being discovered. To have …
[PDF][PDF] Effective community search for large attributed graphs
Given a graph G and a vertex q∈ G, the community search query returns a subgraph of G
that contains vertices related to q. Communities, which are prevalent in attributed graphs …
that contains vertices related to q. Communities, which are prevalent in attributed graphs …
Web-application development using the model/view/controller design pattern
The Model/View/Controller design pattern is very useful for architecting interactive software
systems. This design pattern is partition-independent, because it is expressed in terms of an …
systems. This design pattern is partition-independent, because it is expressed in terms of an …
Graph query processing using plurality of engines
Zou, LL Chen, MT Özsu, D. Zhao, Answering pattern match queries in large graph
databases via graph embedding. The VLDB Journal, Feb. 2012, pp. 97-120, vol. 21, No. 1 …
databases via graph embedding. The VLDB Journal, Feb. 2012, pp. 97-120, vol. 21, No. 1 …
Graph pattern matching: From intractable to polynomial time
Graph pattern matching is typically defined in terms of subgraph isomorphism, which makes
it an np-complete problem. Moreover, it requires bijective functions, which are often too …
it an np-complete problem. Moreover, it requires bijective functions, which are often too …
Incremental graph pattern matching
Graph pattern matching is commonly used in a variety of emerging applications such as
social network analysis. These applications highlight the need for studying the following two …
social network analysis. These applications highlight the need for studying the following two …
Neural-answering logical queries on knowledge graphs
Logical queries constitute an important subset of questions posed in knowledge graph
question answering systems. Yet, effectively answering logical queries on large knowledge …
question answering systems. Yet, effectively answering logical queries on large knowledge …
When engagement meets similarity: efficient (k, r)-core computation on social networks
In this paper, we investigate the problem of (k, r)-core which intends to find cohesive
subgraphs on social networks considering both user engagement and similarity …
subgraphs on social networks considering both user engagement and similarity …