Yixuan Yang

Yixuan Yang

Auto-generated profile, based on publicly available information

Yixuan Yang

Soonchunhyang University

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
23 March 2021 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
YYYixuan Yang
Yixuan Yang
Fei HaoFei Hao
Fei Hao
BPBeibei Pang
Beibei Pang
Geyong  MinGeyong Min
Geyong Min
YWYulei Wu
Yulei Wu
The booming of Social Internet of Things (SIoT) has witnessed the significance of graph mining and analysis for social network management. Online Social Networks (OSNs) can be efficiently managed by monitoring users’ behaviors within a cohesive social group represented by a maximal clique. They can further provide valued social intelligence for their users. Maximal Cliques Problem (MCP) as a fundamental problem in graph mining and analysis is to identify the maximal cliques in a graph. Existing studies on MCP mainly focus on static graphs, with less attention on the detection and dynamic evolution of maximal cliques in OSNs. To fill this gap, we adopt the Formal Concept Analysis (FCA) theory to represent and analyze social networks. We then develop two novel formal concepts generation algorithms, termed Add-FCA and Dec-FCA, that can be applicable to OSNs for detecting the maximal cliques and characterizing the dynamic evolution process of maximal cliques in OSNs. Extensive experimental results are conducted to investigate and demonstrate the correctness and effectiveness of the proposed algorithms. The results reveal that our algorithms can efficiently capture and manage the evolutionary patterns of maximal cliques, including unchanged, changed, added, and vanished maximal cliques in OSNs, and a quantitative relation among them is presented. In addition, an illustrative example is presented to verify the usefulness of the proposed approach.

4 June 2021
Verified
Conference Paper
Closed access
YYYixuan Yang
Yixuan Yang
TYTianfeng Yan
Tianfeng Yan
RF fingerprint recognition is an emerging technology for identifying specific hardware features of wireless transmitters. In order to solve the problem of illegal transmitter hazardous wireless communication security, this paper proposes a method of generating RF fingerprint recognition methods based on generative adversarial net (GAN).This article first uses I / Q data through wavelet transform data pre-processing , Since the wavelet transform can describe the features of different frequency signals, the characteristics of radio frequency fingerprint can be highlighted after wavelet transform of I / Q data. Then we have designed a generative adversarial net model, which consists of a generate model and a discriminant model. Generate model input noise to generate a pseudo data distribution, The discriminant model enters the data distribution of the real trusted transmitter and the generated dummy data distribution generated, and the determination result is fed back to the generator, allowing the generator to update to generate more real pseudo data distributions, better The network model is used for radio frequency fingerprint recognition. Based on the above, it is possible to effectively identify rogue radio frequency transmitters to some extent to solve wireless security issues. The experimental results show that the generative adversarial net (GAN) can distinguish between 98.1% accuracy of the credibility transmitter and illegal transmitter, it has higher accuracy than traditional convolutional neural networks (CNN) and full connectivity neural network (DNN).

14 January 2020 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
BPBeibei Pang
Beibei Pang
Fei HaoFei Hao
Fei Hao
YYYixuan Yang
Yixuan Yang
Doo-Soon ParkDoo-Soon Park
Doo-Soon Park

17 June 2021 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
EYErhe Polytechnical Yang
Erhe Polytechnical Yang
Fei HaoFei Hao
Fei Hao
YYYixuan Yang
Yixuan Yang
CMCarmen De Maio
Carmen De Maio
Aziz NasridinovAziz Nasridinov
Aziz Nasridinov
Laurence YangLaurence Yang
Laurence Yang
Knowledge graph describes entities by numerous RDF data (subject-predicate-object triples), which has been widely applied in various fields, such as artificial intelligence, Semantic Web, entity summarization. With time elapses, the continuously increasing RDF descriptions of entity lead to information overload and further cause people confused. With this backdrop, automatic entity summarization has received much attention in recent years, aiming to select the most concise and most typical facts that depict an entity in brief from lengthy RDF data. As new descriptions of entity are continually coming, creating a compact summary of entity quickly from a lengthy knowledge graph is challenging. To address this problem, this paper firstly formulates the problem and proposes a novel approach of Incremental Entity Summarization by leveraging Formal Concept Analysis (FCA), called IES-FCA. Additionally, we not only prove the rationality of our suggested method mathematically, but also carry out extensive experiments using two real-world datasets. The experimental results demonstrate that the proposed method IES-FCA can save about 8.7% of time consumption for all entities than the non-incremental entity summarization approach KAFCA at best. As for the effectiveness, IES-FCA outperforms the state-of-the-art algorithms in terms of F1-measure, MAP, and NDCG.

3 June 2023
Verified
Book Chapter
Closed access
PDF file
SPSony Peng
Sony Peng
Doo-Soon ParkDoo-Soon Park
Doo-Soon Park
DKDae Young Kim
Dae Young Kim
YYYixuan Yang
Yixuan Yang
SSSophort Siet
Sophort Siet
HLHyeJung Lee
HyeJung Lee

22 August 2023 in Connection Science
Verified
Journal Article
Open access
YYYixuan Yang
Yixuan Yang
SPSony Peng
Sony Peng
SSSophort Siet
Sophort Siet
SISadriddinov Ilkhomjon
Sadriddinov Ilkhomjon
PVPhonexay Vilakone
Phonexay Vilakone
Doo-Soon ParkDoo-Soon Park
Doo-Soon Park