메뉴 건너뛰기
.. 내서재 .. 알림
소속 기관/학교 인증
인증하면 논문, 학술자료 등을  무료로 열람할 수 있어요.
한국대학교, 누리자동차, 시립도서관 등 나의 기관을 확인해보세요
(국내 대학 90% 이상 구독 중)
로그인 회원가입 고객센터 ENG
주제분류

추천
검색
질문

논문 기본 정보

자료유형
학술저널
저자정보
Kumaravel Kaliaperumal (Saveetha University) Meenakshi L. Rathod (Dr. Ambedkar Institute of Technology) Leo Raju (Sri Sivasubramaniya Nadar College of Engineering) J. Mahil (K.Ramakrishnan College of Technology)
저널정보
대한전자공학회 IEIE Transactions on Smart Processing & Computing IEIE Transactions on Smart Processing & Computing Vol.14 No.1
발행연도
2025.2
수록면
1 - 10 (10page)
DOI
10.5573/IEIESPC.2025.14.1.1

이용수

표지
📌
연구주제
📖
연구배경
🔬
연구방법
🏆
연구결과
AI에게 요청하기
추천
검색
질문

초록· 키워드

오류제보하기
In social and real-time network applications, community detection is the very popular and rapidly expanding field of study. Recently, many community detection approaches have been developed. In instance, community detection has proved to be effective and successful in local development strategies. Nevertheless, there are few basic problems to expose the overlapping communities. Although certain techniques are not sensitive enough to demonstrate widespread overlaps, the maximal approaches allow the seeds to be initialized and parameters to be created. A new unsupervised Map Reduce dependent local expanding technique to overlap community dependent seed node finding is presented in this study. The proposed method finds the leader or seed nodes of communities by using simple graph metrics, including closeness, centrality, degree, and betweenness. It then finds the communities that follow the leader nodes. Map-Reduce-oriented is proposed to utilize the Fuzzy C-Means Clustering approach to find which communities overlap depending on the leader nodes. The experimental outcomes illustrate the proposed method (LBCD), which assess network graph allowed the overlapping community structures, is more effectual and confident when used to entire 11 actual-world data sets.

목차

Abstract
1. Introduction
2. Related Work
3. Proposed Architecture
4. Find the Every Shortest Pair Utilizing Giraph
5. Degree of Influence (DI) Computation Utilizing Map-reduce Method
6. Leader Nodes Identification
7. Community creation
8. Results with Discussions
9. Conclusion with future work
References

참고문헌 (0)

참고문헌 신청

함께 읽어보면 좋을 논문

논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!

최근 본 자료

전체보기

댓글(0)

0

UCI(KEPA) : I410-151-25-02-092293769