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
×
Spring Sale: Get 35% off with a min. purchase of 2 titles. Use code SPRING35. Valid till 31st Mar 2025.

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

ADAPTIVE ANTS CLUSTERING ALGORITHM MIMING CORRELATIVE PAGE SET

    This work is supported by NSFC, NO. 50378093.

    https://doi.org/10.1142/9789812701534_0140Cited by:0 (Source: Crossref)
    Abstract:

    Performance of ants clustering is very sensitive to the key parameters in ants algorithm, this paper analyses how to adjust key parameters adaptively to improve ants clustering. It also brings forward a improved method making use of pheromone and ant’s local memory to direct ant to move effectively, whereas ants are moving randomly after picking up or dropping an object in recent ants clustering algorithm. As the parallel nature of ants cluster, we apply AACA in web mining to mine correlative page set and make it suitable to dispose dynamic and large quantity of web log.