Kilho Shin

Prof. Dr. Kilho Shin

Gakushuin University
orcid

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
Verified
Journal Article
Open access
PDF file
TZTianyu Zhang
Tianyu Zhang
QZQian Zhao
Qian Zhao
KSKilho Shin
Kilho Shin
YNYukikazu Nakamoto
Yukikazu Nakamoto
We propose a new peak searching algorithm (PSA) that uses Bayesian optimization to find probability peaks in a dataset, thereby increasing the speed and accuracy of clustering algorithms. Wireless sensor networks (WSNs) are becoming increasingly common in a wide variety of applications that analyze and use collected sensing data. Typically, the collected data cannot be directly used in modern data analysis problems that adopt machine learning techniques because such data lacks additional information (such as data labels) specifying its purpose of users. Clustering algorithms that divide the data in a dataset into clusters are often used when additional information is not provided. However, traditional clustering algorithms such as expectation–maximization (EM) and k - m e a n s algorithms require massive numbers of iterations to form clusters. Processing speeds are therefore slow, and clustering results become less accurate because of the way such algorithms form clusters. The PSA addresses these problems, and we adapt it for use with the EM and k - m e a n s algorithms, creating the modified P S E M and P S k - m e a n s algorithms. Our simulation results show that our proposed P S E M and P S k - m e a n s algorithms significantly decrease the required number of clustering iterations (by 1.99 to 6.3 times), and produce clustering that, for a synthetic dataset, is 1.69 to 1.71 times more accurate than it is for traditional EM and enhanced k - m e a n s ( k - m e a n s ++) algorithms. Moreover, in a simulation of WSN applications aimed at detecting outliers, P S E M correctly identified the outliers in a real dataset, decreasing iterations by approximately 1.88 times, and P S E M was 1.29 times more accurate than EM at a maximum.

1 October 2020 in The Journal of Supercomputing
Verified
Journal Article
Open access
PDF file
THTakako Hashimoto
Takako Hashimoto
DSDavid Lawrence Shepard
David Lawrence Shepard
TKTetsuji Kuboyama
Tetsuji Kuboyama
KSKilho Shin
Kilho Shin
RKRyota Kobayashi
Ryota Kobayashi
TUTakeaki Uno
Takeaki Uno
During a disaster, social media can be both a source of help and of danger: Social media has a potential to diffuse rumors, and officials involved in disaster mitigation must react quickly to the spread of rumor on social media. In this paper, we investigate how topic diversity (i.e., homogeneity of opinions in a topic) depends on the truthfulness of a topic (whether it is a rumor or a non-rumor) and how the topic diversity changes in time after a disaster. To do so, we develop a method for quantifying the topic diversity of the tweet data based on text content. The proposed method is based on clustering a tweet graph using Data polishing that automatically determines the number of subtopics. We perform a case study of tweets posted after the East Japan Great Earthquake on March 11, 2011. We find that rumor topics exhibit more homogeneity of opinions in a topic during diffusion than non-rumor topics. Furthermore, we evaluate the performance of our method and demonstrate its improvement on the runtime for data processing over existing methods.

24 September 2015 in Computational Intelligence
Verified
Journal Article
Closed access
PDF file
KSKilho Shin
Kilho Shin
SMSeiya Miyazaki
Seiya Miyazaki

Verified
Journal Article
Open access
PDF file
KSKilho Shin
Kilho Shin
TITaichi Ishikawa
Taichi Ishikawa
YLYu-Lu Liu
Yu-Lu Liu
DSDavid Lawrence Shepard
David Lawrence Shepard
The subpath kernel is a class of positive definite kernels defined over trees, which has the following advantages for the purposes of classification, regression and clustering: it can be incorporated into a variety of powerful kernel machines including SVM; It is invariant whether input trees are ordered or unordered; It can be computed by significantly fast linear-time algorithms; And, finally, its excellent learning performance has been proven through intensive experiments in the literature. In this paper, we leverage recent advances in tree kernels to solve real problems. As an example, we apply our method to the problem of detecting fake e-commerce sites. Although the problem is similar to phishing site detection, the fact that mimicking existing authentic sites is harmful for fake e-commerce sites marks a clear difference between these two problems. We focus on fake e-commerce site detection for three reasons: e-commerce fraud is a real problem that companies and law enforcement have been cooperating to solve; Inefficiency hampers existing approaches because datasets tend to be large, while subpath kernel learning overcomes these performance challenges; And we offer increased resiliency against attempts to subvert existing detection methods through incorporating robust features that adversaries cannot change: the DOM-trees of web-sites. Our real-world results are remarkable: our method has exhibited accuracy as high as 0.998 when training SVM with 1000 instances and evaluating accuracy for almost 7000 independent instances. Its generalization efficiency is also excellent: with only 100 training instances, the accuracy score reached 0.996.

30 June 2022 in Algorithms
Verified
Journal Article
Open access
PDF file
SOShinji Ono
Shinji Ono
JTJun Takata
Jun Takata
MKMasaharu Kataoka
Masaharu Kataoka
TITomohiro I
Tomohiro I
KSKilho Shin
Kilho Shin
Hiroshi SakamotoHiroshi Sakamoto
Hiroshi Sakamoto
For the feature selection problem, we propose an efficient privacy-preserving algorithm. Let D, F, and C be data, feature, and class sets, respectively, where the feature value x(Fi) and the class label x(C) are given for each x∈D and Fi∈F. For a triple (D,F,C), the feature selection problem is to find a consistent and minimal subset F′⊆F, where ‘consistent’ means that, for any x,y∈D, x(C)=y(C) if x(Fi)=y(Fi) for Fi∈F′, and ‘minimal’ means that any proper subset of F′ is no longer consistent. On distributed datasets, we consider feature selection as a privacy-preserving problem: assume that semi-honest parties A and B have their own personal DA and DB. The goal is to solve the feature selection problem for DA∪DB without sacrificing their privacy. In this paper, we propose a secure and efficient algorithm based on fully homomorphic encryption, and we implement our algorithm to show its effectiveness for various practical data. The proposed algorithm is the first one that can directly simulate the CWC (Combination of Weakest Components) algorithm on ciphertext, which is one of the best performers for the feature selection problem on the plaintext.

5 April 2021
Verified
Book Chapter
Closed access
PDF file
MHMaciej Huk
Maciej Huk
KSKilho Shin
Kilho Shin
TKTetsuji Kuboyama
Tetsuji Kuboyama
THTakako Hashimoto
Takako Hashimoto