NDLI: An Extension to Hub Algorithm Based on Triangular Loop

Content Provider	IEEE Xplore Digital Library
Author	Xiongtao Ma Chongming Bao Lei Li Lihua Zhou Bing Kong
Copyright Year	2014
Description	Author affiliation: Sch. of Inf., Yunnan Univ., Kunming, China (Xiongtao Ma; Lei Li; Lihua Zhou; Bing Kong) \|\| Sch. of Software, Yunnan Univ., Kunming, China (Chongming Bao)
Abstract	The algorithm of breadth first traversal in graph has been widely applied in community detection. Some community detection algorithms based on the breadth first traversal usually use the largest node the largest as the initial node. And these algorithms determine a node belongs to which community according to the number of the edges from the node to the communities. And then in the high aggregated networks, the results of community detection are not appropriate. The algorithm in this paper extends the Hub algorithm. This algorithm puts forward the concept of the degree of triangular loop of nodes, and use it to find the center of community. In the process of community detecting, this algorithm defines the concept of the similarity coefficient. And based on the similarity coefficient, this algorithm determines which community the nodes belong to, as well as adjusts the results of community detecting. The experiment confirms that the algorithm in this paper can not only guarantee the feasibility but also improve the quality of community detecting.
Starting Page	297
Ending Page	303
File Size	346093
Page Count	7
File Format	PDF
e-ISBN	9781479962365
DOI	10.1109/CyberC.2014.60
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2014-10-13
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Center node Community detection Knowledge discovery Breadth first search Triangular loop Distributed computing
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Enhanced GPU-based distributed breadth first search

Breadth-First Search-Based Single-Phase Algorithms for Bridge Detection in Wireless Sensor Networks

Using Tadpoles to Reduce Memory and Communication Requirements for Exhaustive, Breadth-First Search Using Distributed Computers (1997)

Distributed multithreaded breadth-first search on large graphs using DXGraph

A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L

Using Tadpoles to Reduce Memory and Communication Requirements for Exhaustive, Breadth-First Search Using Distributed Computers (1997)

Reducing Communication in Parallel Breadth-First Search on Distributed Memory Systems

Artificial Intelligence 170 (2006) 385–408 Breadth-first heuristic search (2005)

Distributed Memory Breadth-First Search Revisited: Enabling Bottom-Up Search

An Extension to Hub Algorithm Based on Triangular Loop

Similar Documents

Enhanced GPU-based distributed breadth first search

Breadth-First Search-Based Single-Phase Algorithms for Bridge Detection in Wireless Sensor Networks

Using Tadpoles to Reduce Memory and Communication Requirements for Exhaustive, Breadth-First Search Using Distributed Computers (1997)

Distributed multithreaded breadth-first search on large graphs using DXGraph

A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L

Using Tadpoles to Reduce Memory and Communication Requirements for Exhaustive, Breadth-First Search Using Distributed Computers (1997)

Reducing Communication in Parallel Breadth-First Search on Distributed Memory Systems

Artificial Intelligence 170 (2006) 385–408 Breadth-first heuristic search (2005)

Distributed Memory Breadth-First Search Revisited: Enabling Bottom-Up Search

An Extension to Hub Algorithm Based on Triangular Loop