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-valued edge weights, the problem of correlation k-clustering with pre-clustered items is to extend a k-clustering of distinguished vertices of G (pre-clustered items) to partition all the vertices into clusters so as to minimize the total absolute weight of cut positive edges and uncut negative edges. This problem for general graphs is APX-complete. A polynomial...
We consider the following correlation k-clustering problem: given a graph with real-valued edge weights (both positive and negative), extend a k-clustering of some vertices to partition all the vertices into clusters so as to maximize the total absolute weight of cut negative edges and uncut positive edges. This problem for general graphs is NP-complete for all fixed k ges 2. We present polynomial...
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.