[PDF][PDF] Uncovering the Largest Community in Social Networks at Scale.
Abstract The Maximum k-Plex Search (MPS) can find the largest k-plex, which is a
generalization of the largest clique. Although MPS is commonly used in AI to effectively …
generalization of the largest clique. Although MPS is commonly used in AI to effectively …
Scalable affinity propagation for massive datasets
H Shiokawa - Proceedings of the AAAI Conference on Artificial …, 2021 - ojs.aaai.org
Affinity Propagation (AP) is a fundamental algorithm to identify clusters included in data
objects. Given a similarities among objects, it iteratively performs message updates between …
objects. Given a similarities among objects, it iteratively performs message updates between …
[PDF][PDF] Efficient correlated subgraph searches for ai-powered drug discovery
H Shiokawa, Y Naoi, S Matsugu - … of the Thirty-Third International Joint …, 2024 - ijcai.org
Correlated subgraph searches (CSSs) are essential building blocks for AI-powered drug
discovery. Given a query molecule modeled as a graph, CSS finds top-k molecules …
discovery. Given a query molecule modeled as a graph, CSS finds top-k molecules …
DSCAN: distributed structural graph clustering for billion-edge graphs
H Shiokawa, T Takahashi - … 2020, Bratislava, Slovakia, September 14–17 …, 2020 - Springer
The structural graph clustering algorithm (SCAN) is an essential graph mining tool that
reveals clusters, hubs, and outliers included in a given graph. Although SCAN is used in …
reveals clusters, hubs, and outliers included in a given graph. Although SCAN is used in …
Indexing complex networks for fast attributed kNN queries
S Kobayashi, S Matsugu, H Shiokawa - Social Network Analysis and …, 2022 - Springer
The k nearest neighbor (k NN) query is an essential graph data-management tool used for
finding relevant data entities suited to a user-specified query node. Graph indexing methods …
finding relevant data entities suited to a user-specified query node. Graph indexing methods …
Fast ObjectRank for large knowledge databases
H Shiokawa - The Semantic Web–ISWC 2021: 20th International …, 2021 - Springer
ObjectRank is an essential tool to evaluate an importance of nodes for a user-specified
query in heterogeneous graphs. However, existing methods are not applicable to massive …
query in heterogeneous graphs. However, existing methods are not applicable to massive …
Fast algorithm for attributed community search
Searching communities on attributed graphs has attracted much attention in recent years.
The community search algorithm is currently an essential graph data management tool to …
The community search algorithm is currently an essential graph data management tool to …
Flexible community search algorithm on attributed graphs
How can the most appropriate community be found given an attributed graph and a user-
specified query node? The community search algorithm is currently an essential graph data …
specified query node? The community search algorithm is currently an essential graph data …
Boosting Similar Compounds Searches via Correlated Subgraph Analysis
Y Naoi, H Shiokawa - … Conference on Information Integration and Web …, 2023 - Springer
Graph similarity search (GSS) models chemical compounds as a graph database. GSS is an
essential tool for drug discovery because they can find similar graphs (compounds) for a …
essential tool for drug discovery because they can find similar graphs (compounds) for a …
Efficient Similarity Searches for Multivariate Time Series: A Hash-Based Approach
Y Yasuda, H Shiokawa - … Conference on Information Integration and Web …, 2023 - Springer
Various fields from biomedicine to sports science employ similarity searches in multivariate
time series (MvTS) to identify patterns and trends. Given MvTS and a query time series, a …
time series (MvTS) to identify patterns and trends. Given MvTS and a query time series, a …