A novel graph clustering algorithm based on discrete-time quantum random walk
S.G. Roya; A. Chakrabartib a Techno India College of Technology, New Town, Kolkata, WB, Indiab A.K. Choudhury School of Information Technology, University of Calcutta, Kolkata, WB, India
Abstract
The clustering activity is an unsupervised learning observation which coalesces the data into segments. Grouping of data is done by identification of common characteristics that are labeled as similarities among data on the basis of their characteristics. Graph clustering is a tool needed in many computer applications, such as network routing, analysis of social networks, computer vision, and VLSI physical design. This chapter explains how quantum random ...
Get Quantum Inspired Computational Intelligence now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
