Search Results - "Zou, Zhaonian"
-
1
On flexible cohesive subgraph mining
Published in World wide web (Bussum) (01-03-2022)“…When characterizing the cohesion of a subgraph, many cohesive subgraph models impose various constraints on the relationship between the minimum degree of…”
Get full text
Journal Article -
2
Mining Frequent Subgraph Patterns from Uncertain Graph Data
Published in IEEE transactions on knowledge and data engineering (01-09-2010)“…In many real applications, graph data is subject to uncertainties due to incompleteness and imprecision of data. Mining such uncertain graph data is…”
Get full text
Journal Article -
3
Distributed processing of regular path queries in RDF graphs
Published in Knowledge and information systems (01-04-2021)“…SPARQL 1.1 offers a type of navigational query for RDF systems, called regular path query (RPQ). A regular path query allows for retrieving node pairs with the…”
Get full text
Journal Article -
4
SimRank on Uncertain Graphs
Published in IEEE transactions on knowledge and data engineering (01-11-2017)“…SimRank is a similarity measure between vertices in a graph. Recently, many algorithms have been proposed to efficiently evaluate SimRank similarities…”
Get full text
Journal Article -
5
Diversified Coherent Core Search on Multi-Layer Graphs
Published in 2018 IEEE 34th International Conference on Data Engineering (ICDE) (01-04-2018)“…Mining dense subgraphs on multi-layer graphs is an interesting problem, which has witnessed lots of applications in practice. To overcome the limitations of…”
Get full text
Conference Proceeding -
6
Mining frequent subgraphs over uncertain graph databases under probabilistic semantics
Published in The VLDB journal (01-12-2012)“…Frequent subgraph mining has been extensively studied on certain graph data. However, uncertainty is intrinsic in graph data in practice, but there is very few…”
Get full text
Journal Article -
7
Finding top-k maximal cliques in an uncertain graph
Published in 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010) (01-03-2010)“…Existing studies on graph mining focus on exact graphs that are precise and complete. However, graph data tends to be uncertain in practice due to noise,…”
Get full text
Conference Proceeding -
8
Scalable Processing of Massive Uncertain Graph Data: A Simultaneous Processing Approach
Published in 2017 IEEE 33rd International Conference on Data Engineering (ICDE) (01-04-2017)“…This paper studies a novel approach to processing massive uncertain graph data. In this approach, we propose a new framework to simultaneously process a query…”
Get full text
Conference Proceeding -
9
Subgraph matching on temporal graphs
Published in Information sciences (01-11-2021)“…Temporal graphs are graphs whose edges are associated with timestamps. Subgraph matching on temporal graphs retrieves temporal subgraphs whose edge timestamps…”
Get full text
Journal Article -
10
Community Detection On Multi-layer Graph using Intra-layer and Inter-layer Linkage Graphs (CDMIILG)
Published in Expert systems with applications (15-03-2024)“…Effective communication in complex networks is crucial for users and organizations, so graph theory is being used to provide solid groundwork for modeling and…”
Get full text
Journal Article -
11
Multi-Layer Stochastic Block Interaction driven by Logistic Regression (MLSBI-LR) for Efficient Link Recommendation in Intra-Layer Linkage Graphs
Published in Information sciences (01-11-2023)“…Link Recommendation (LR) in complex networks has attracted huge interest in the social and computer science communities. Numerous networks, such as…”
Get full text
Journal Article -
12
Durable Subgraph Matching on Temporal Graphs
Published in IEEE transactions on knowledge and data engineering (01-05-2023)“…Durable subgraph matching on a temporal graph finds all subgraphs in the temporal graph that not only match the given query graph but also have duration longer…”
Get full text
Journal Article -
13
Truss decomposition of uncertain graphs
Published in Knowledge and information systems (2017)“…The k -truss of a graph is the largest edge-induced subgraph such that every edge is contained in at least k triangles within the subgraph, where a triangle is…”
Get full text
Journal Article -
14
Effective and efficient aggregation on uncertain graphs
Published in Fuzzy sets and systems (05-10-2022)“…Large-scale graphs are widely used to model the entities and their complex relations. Uncertain graphs are adopted when the relations between entities contain…”
Get full text
Journal Article -
15
Top-k Reliability Search on Uncertain Graphs
Published in 2015 IEEE International Conference on Data Mining (01-11-2015)“…Uncertain graphs have been widely used to represent graph data with inherent uncertainty in structures. Reliability search is a fundamental problem in…”
Get full text
Conference Proceeding Journal Article -
16
An effective keyword search co-occurrence multi-layer graph mining approach
Published in Machine learning (01-08-2024)“…A combination of tools and methods known as "graph mining" is used to evaluate real-world graphs, forecast the potential effects of a given graph’s structure…”
Get full text
Journal Article -
17
Structural-Context Similarities for Uncertain Graphs
Published in 2013 IEEE 13th International Conference on Data Mining (01-12-2013)“…Structural-context similarities between vertices in graphs, such as the Jaccard similarity, the Dice similarity, and the cosine similarity, play important…”
Get full text
Conference Proceeding Journal Article -
18
Evolving subgraph matching on temporal graphs
Published in Knowledge-based systems (22-12-2022)“…Given a set of query graphs and specified orders between these query graphs, the evolving subgraph matching problem finds all subgraph sets from the temporal…”
Get full text
Journal Article -
19
Fast diversified coherent core search on multi-layer graphs
Published in The VLDB journal (01-08-2019)“…Mining dense subgraphs on multi-layer graphs is an interesting problem, which has witnessed lots of applications in practice. To overcome the limitations of…”
Get full text
Journal Article -
20
MSDS: A Novel Framework for Multi-Source Data Selection Based Cross-Network Node Classification
Published in IEEE transactions on knowledge and data engineering (01-12-2023)“…In this paper, we study the problem of multi-source cross-network node classification, which aims to classify unlabeled nodes in a target network by leveraging…”
Get full text
Journal Article