[PDF][PDF] Uncovering the Largest Community in Social Networks at Scale.

S Matsugu, Y Fujiwara, H Shiokawa - IJCAI, 2023 - ijcai.org
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 …

Fast Top-k Similar Sequence Search on DNA Databases

R Yagi, H Shiokawa - … Conference on Information Integration and Web, 2022 - Springer
Top-k similar sequence search is an essential tool for DNA data management. Given a DNA
database, it is a problem to extract k similar DNA sequence pairs in the database, which …

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 …

Clustering study of vehicle behaviors using license plate recognition

D Bolaños-Martinez, M Bermudez-Edo… - … on Ubiquitous Computing …, 2022 - Springer
Ubiquitous computing and artificial intelligence contribute to deploying intelligent
environments. Sensor networks in cities generate large amounts of data that can be …

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 …

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 …

A study on the improvement of K-means algorithm based on community discovery

S Jia - 5th International Conference on Artificial Intelligence …, 2023 - ieeexplore.ieee.org
The k-means algorithm, as one of the top ten classical data mining algorithms, has been
widely used in various fields due to its high efficiency since it was proposed. However, with …

Fast indexing algorithm for efficient kNN queries on complex networks

S Kobayashi, S Matsugu, H Shiokawa - Proceedings of the 2021 IEEE …, 2021 - dl.acm.org
k nearest neighbor (k NN) query is an essential graph data management tool to find relevant
data entities suited to a user-specified query node. Graph indexing methods have the …

An Efficient Indexing Method for Dynamic Graph kNN

S Matsugu, S Kobayashi, H Shiokawa - International Conference on …, 2024 - Springer
Abstract k-nearest neighbor (k NN) search is a fundamental problem in graph mining. This
search finds the k most relevant nodes to a given query node. The increased use of social …

Fast Correlated DNA Subsequence Search via Graph-Based Representation

R Yagi, Y Naoi, H Shiokawa - International Conference on Information …, 2023 - Springer
Numerous fields employ correlation-based searches to provide insights about relationships
in a database. Herein we propose a correlated DNA subsequence search for DNA …