Sadriddinov Ilkhomjon Rovshan Ugli
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Sadriddinov Ilkhomjon Rovshan Ugli has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Doo-Soon Park
Soonchunhyang University
4 shared publications - Dae Young Kim
Department of Computer Software Engineering, Soonchunhyang University, Asan 31538, Republic of Korea
3 shared publications - Sony Peng
Department of Software Convergence, Soonchunhyang University, Asan-si 31538, Republic of Korea
3 shared publications - Sophort Siet
Soonchunhyang University
3 shared publications - Yixuan Yang
Soonchunhyang University
3 shared publications - Gangman Yi
Dongguk University
1 shared publication
Latest Publications
- Open Access
- 27 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 35113-35123
Algorithm for Mining Maximal Balanced Bicliques Using Formal Concept Analysis
One of the most fundamental models for cohesive subgraph mining in network analysis is that which involves the use of cliques. In bipartite graph analysis, the detection of maximal balanced bicliques (MBB) is an important problem with numerous applications, including VLSI design, protein interactions, and social networks. However, MBB detection is difficult, complex, and time-consuming. In the current paper, to address these disadvantages, we propose a new algorithm for detecting MBB using formal concept analysis (FCA) on bipartite graphs. We applied an algorithm to compute formal concepts from the formal context, which is an alternative way of representing a bipartite graph.We proved that the MBB problem is equivalent to the semi-equiconcept enumeration problem in the formal context. Therefore, the semi-equiconcept mining algorithm was applied to theMBB enumeration problem. However, since the existing FCA algorithm cannot be directly applied to mine all MBBs, the FCA algorithm was modified in its entirety. Thorough asymptotic analysis was performed on the proposed algorithm. Experiments were also conducted on various real-world bipartite graphs to which the proposed algorithm was applied, and our results were found to be significantly better than those obtained by the preexisting algorithm.
- 27 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 35113-35123
Open AccessAlgorithm for Mining Maximal Balanced Bicliques Using Formal Concept Analysis
One of the most fundamental models for cohesive subgraph mining in network analysis is that which involves the use of cliques. In bipartite graph analysis, the detection of maximal balanced bicliques (MBB) is an important problem with numerous applications, including VLSI design, protein interactions, and social networks. However, MBB detection is difficult, complex, and time-consuming. In the current paper, to address these disadvantages, we propose a new algorithm for detecting MBB using formal concept analysis (FCA) on bipartite graphs. We applied an algorithm to compute formal concepts from the formal context, which is an alternative way of representing a bipartite graph.We proved that the MBB problem is equivalent to the semi-equiconcept enumeration problem in the formal context. Therefore, the semi-equiconcept mining algorithm was applied to theMBB enumeration problem. However, since the existing FCA algorithm cannot be directly applied to mine all MBBs, the FCA algorithm was modified in its entirety. Thorough asymptotic analysis was performed on the proposed algorithm. Experiments were also conducted on various real-world bipartite graphs to which the proposed algorithm was applied, and our results were found to be significantly better than those obtained by the preexisting algorithm.
- 3 June 2023
- Published by Springer Nature
- p. 577-582
A Modern Recommendation System Survey in the Big Data Era
- 3 June 2023
- Published by Springer Nature
- p. 577-582
A Modern Recommendation System Survey in the Big Data Era
- 3 June 2023
- Published by Springer Nature
- p. 569-576
A Model for Detection of the Susceptible in Hospital Contact Network Based on Social Network Analysis
- 3 June 2023
- Published by Springer Nature
- p. 569-576
A Model for Detection of the Susceptible in Hospital Contact Network Based on Social Network Analysis
- 3 June 2023
- Published by Springer Nature
- p. 599-605
Movie Recommendation System Using Community Detection Based on the Girvan–Newman Algorithm
- 3 June 2023
- Published by Springer Nature
- p. 599-605
Movie Recommendation System Using Community Detection Based on the Girvan–Newman Algorithm