119 Result(s)
-
Article
Multi-representation web service recommendation system based on attention mechanism
Recently, mashup developers seek to integrate multiple services with complementary functionalities from a large amount of web services. With so many available web services, it is difficult for developers to ch...
-
Article
Efficient algorithms for reachability and path queries on temporal bipartite graphs
Bipartite graphs are naturally used to model relationships between two types of entities, such as people-location, user-post, and investor-stock. When modeling real-world applications like disease outbreaks, e...
-
Article
Label-constrained shortest path query processing on road networks
Computing the shortest path between two vertices is a fundamental problem in road networks. Most of the existing works assume that the edges in the road networks have no labels, but in many real applications, ...
-
Article
Rumor blocking with pertinence set in large graphs
Online social networks facilitate the spread of information, while rumors can also propagate widely and fast, which may mislead some users. Therefore, suppressing the spread of rumors has become a daunting tas...
-
Chapter and Conference Paper
Efficient Maximum Relative Fair Clique Computation in Attributed Graphs
Cohesive subgraph mining is a fundamental problem in attributed graph analysis. However, the existing models on attributed graphs ignore the fairness of attributes. In this paper, we propose a novel model, cal...
-
Chapter and Conference Paper
Discovering Densest Subgraph over Heterogeneous Information Networks
Densest Subgraph Discovery (DSD) is a fundamental and challenging problem in the field of graph mining in recent years. The DSD aims to determine, given a graph G, the subgraph with the maximum density according ...
-
Chapter and Conference Paper
Balanced Hop-Constrained Path Enumeration in Signed Directed Graphs
Hop-constrained path enumeration, which aims to output all the paths from two distinct vertices within the given hops, is one of the fundamental tasks in graph analysis. Previous works about this problem mainl...
-
Article
Open AccessFPGN: follower prediction framework for infectious disease prevention
In recent years, how to prevent the widespread transmission of infectious diseases in communities has been a research hot spot. Tracing close contact with infected individuals is one of the most severe problem...
-
Article
When hierarchy meets 2-hop-labeling: efficient shortest distance and path queries on road networks
Computing the shortest distance between two vertices is a fundamental problem in road networks. Since a direct search using the Dijkstra’s algorithm results in a large search space, researchers resort to index...
-
Article
Open AccessMAFSIDS: a reinforcement learning-based intrusion detection model for multi-agent feature selection networks
Large unbalanced datasets pose challenges for machine learning models, as redundant and irrelevant features can hinder their effectiveness. Furthermore, the performance of intrusion detection systems (IDS) can...
-
Article
Cardinality estimation with smoothing autoregressive models
Cardinality estimation, which aims at accurately estimating the result size of queries, is a fundamental task in database query processing and optimization. One of the most recent and effective solutions to th...
-
Article
Open AccessRisk and UCON-based access control model for healthcare big data
The rapid development of healthcare big data has brought certain convenience to medical research and health management, but privacy protection of healthcare big data is an issue that must be considered in the ...
-
Article
Open AccessAccelerated butterfly counting with vertex priority on bipartite graphs
Bipartite graphs are of great importance in many real-world applications. Butterfly, which is a complete \(2 \times 2\) ...
-
Article
Open AccessMaximum and top-k diversified biclique search at scale
Maximum biclique search, which finds the biclique with the maximum number of edges in a bipartite graph, is a fundamental problem with a wide spectrum of applications in different domains, such as E-Commerce, ...
-
Article
General graph generators: experiments, analyses, and improvements
Graph simulation is one of the most fundamental problems in graph processing and analytics. It can help users to generate new graphs on different scales to mimic observed real-life graphs in many applications ...
-
Article
Span-reachability querying in large temporal graphs
Reachability is a fundamental problem in graph analysis. In applications such as social networks and collaboration networks, edges are always associated with timestamps. Most existing works on reachability que...
-
Article
Continuous monitoring of moving skyline and top-k queries
Given a set of criteria, an object o dominates another object \(o'\) o ...
-
Article
Anchored coreness: efficient reinforcement of social networks
The stability of a social network has been widely studied as an important indicator for both the network holders and the participants. Existing works on reinforcing networks focus on a local view, e.g., the an...
-
Article
Towards efficient solutions of bitruss decomposition for large-scale bipartite graphs
In recent years, cohesive subgraph mining in bipartite graphs becomes a popular research topic. An important cohesive subgraph model k-bitruss is the maximal cohesive subgraph where each edge is contained in at l...
-
Article
Answering reachability and K-reach queries on large graphs with label constraints
The purpose of this paper is to examine the problem of label-constrained reachability (LCR) and K-reach (LCKR) queries, which are fundamental in a wide variety of applications using directed edge-labeled graphs. ...
