World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×
Our website is made possible by displaying certain online content using javascript.
In order to view the full content, please disable your ad blocker or whitelist our website www.worldscientific.com.

System Upgrade on Fri, Jun 26th, 2020 at 5pm (ET)

During this period, our website will be offline for less than an hour but the E-commerce and registration of new users may not be available for up to 4 hours.
For online purchase, please visit us again. Contact us at [email protected] for any enquiries.
Abstract:

There is a pressing need for new pattern recognition tools and statistical methods to quantify large graphs and predict the behaviour of network systems, due to the large amount of data which can be extracted from the web. In this work a graph mining metric, based on k-clique communities, is used, allowing a better understanding of the network structure. The proposed metric shows that for different graph families correspond different k-clique sequences.