The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Given a graph G=(V,E) with real positive edge weights, where each edge (u, v) is labeled either + or - depending on whether u and v have been deemed to be similar or dissimilar, the problem of correlation clustering with l clusters is to partition the vertices of G into at most l clusters to minimize the total weight of + edges between clusters and - edges within clusters. This problem for general...
At first, some improvements were done in a single ant colony clustering algorithm, then, for different speed ant colony, clustering analysis was finished independently and in parallel by imitating the collaborative performance of multi-colony, and clustering results were combined into a hyper-graph and second division was made in the hyper-graph using ACA, at last, the test result for four databases...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.