Matches in SemOpenAlex for { <https://semopenalex.org/work/W4367178834> ?p ?o ?g. }
Showing items 1 to 72 of
72
with 100 items per page.
- W4367178834 endingPage "18" @default.
- W4367178834 startingPage "1" @default.
- W4367178834 abstract "Correlation clustering problem (CorCP) is a classical clustering problem, which clusters data based on the similarity of data set, and has many applications in interaction networks, cross-lingual link detection, and communication networks, etc. In this paper, we study a practical generalization of the CorCP, called the capacitated correlation clustering problem (the capacitated CorCP), by constructing a labeled complete graph. On this labeled complete graph, each vertex represents a piece of data. If two pieces of data are similar, then the edge between the corresponding vertices is marked by a positive label [Formula: see text]. Otherwise, this edge is marked by a negative label −. The objective of the capacitated CorCP is to group some similar data sets into one cluster as far as possible, while satisfying the cluster capacity constraint. To achieve this objective, we shall partition the vertex set of the labeled complete graph into several clusters, each cluster’s size subjecting to an upper bound, so as to minimize the number of disagreements. Here the number of disagreements is defined as the total number of the edges with positive labels between clusters and the edges with negative labels within clusters. Different with the previous algorithm in [18], which subjects to the constraint on the cluster size by a penalty measure, we design an algorithm for the capacitated CorCP to directly output a feasible solution by iteratively constructing clusters based on a preset threshold. Through carefully setting the threshold and sophisticatedly analyzing, our algorithm is proved to have an improved approximation ratio of 5.37. In addition, we also conduct a series of numerical experiments to demonstrate the effectiveness of our algorithm." @default.
- W4367178834 created "2023-04-28" @default.
- W4367178834 creator A5001743189 @default.
- W4367178834 creator A5030143779 @default.
- W4367178834 creator A5078599294 @default.
- W4367178834 creator A5078662421 @default.
- W4367178834 date "2023-04-27" @default.
- W4367178834 modified "2023-10-14" @default.
- W4367178834 title "An Improved Approximation Algorithm for the Capacitated Correlation Clustering Problem" @default.
- W4367178834 doi "https://doi.org/10.1142/s0129054123410010" @default.
- W4367178834 hasPublicationYear "2023" @default.
- W4367178834 type Work @default.
- W4367178834 citedByCount "0" @default.
- W4367178834 crossrefType "journal-article" @default.
- W4367178834 hasAuthorship W4367178834A5001743189 @default.
- W4367178834 hasAuthorship W4367178834A5030143779 @default.
- W4367178834 hasAuthorship W4367178834A5078599294 @default.
- W4367178834 hasAuthorship W4367178834A5078662421 @default.
- W4367178834 hasConcept C105795698 @default.
- W4367178834 hasConcept C11413529 @default.
- W4367178834 hasConcept C114614502 @default.
- W4367178834 hasConcept C118615104 @default.
- W4367178834 hasConcept C132525143 @default.
- W4367178834 hasConcept C134306372 @default.
- W4367178834 hasConcept C148764684 @default.
- W4367178834 hasConcept C177148314 @default.
- W4367178834 hasConcept C2524010 @default.
- W4367178834 hasConcept C2776036281 @default.
- W4367178834 hasConcept C33923547 @default.
- W4367178834 hasConcept C42812 @default.
- W4367178834 hasConcept C48903430 @default.
- W4367178834 hasConcept C73555534 @default.
- W4367178834 hasConcept C80899671 @default.
- W4367178834 hasConcept C94641424 @default.
- W4367178834 hasConceptScore W4367178834C105795698 @default.
- W4367178834 hasConceptScore W4367178834C11413529 @default.
- W4367178834 hasConceptScore W4367178834C114614502 @default.
- W4367178834 hasConceptScore W4367178834C118615104 @default.
- W4367178834 hasConceptScore W4367178834C132525143 @default.
- W4367178834 hasConceptScore W4367178834C134306372 @default.
- W4367178834 hasConceptScore W4367178834C148764684 @default.
- W4367178834 hasConceptScore W4367178834C177148314 @default.
- W4367178834 hasConceptScore W4367178834C2524010 @default.
- W4367178834 hasConceptScore W4367178834C2776036281 @default.
- W4367178834 hasConceptScore W4367178834C33923547 @default.
- W4367178834 hasConceptScore W4367178834C42812 @default.
- W4367178834 hasConceptScore W4367178834C48903430 @default.
- W4367178834 hasConceptScore W4367178834C73555534 @default.
- W4367178834 hasConceptScore W4367178834C80899671 @default.
- W4367178834 hasConceptScore W4367178834C94641424 @default.
- W4367178834 hasFunder F4320321001 @default.
- W4367178834 hasFunder F4320321543 @default.
- W4367178834 hasFunder F4320324174 @default.
- W4367178834 hasFunder F4320327794 @default.
- W4367178834 hasLocation W43671788341 @default.
- W4367178834 hasOpenAccess W4367178834 @default.
- W4367178834 hasPrimaryLocation W43671788341 @default.
- W4367178834 hasRelatedWork W1867506060 @default.
- W4367178834 hasRelatedWork W2374778222 @default.
- W4367178834 hasRelatedWork W2949883286 @default.
- W4367178834 hasRelatedWork W3087852249 @default.
- W4367178834 hasRelatedWork W3187949862 @default.
- W4367178834 hasRelatedWork W3193623490 @default.
- W4367178834 hasRelatedWork W4244487191 @default.
- W4367178834 hasRelatedWork W4292731430 @default.
- W4367178834 hasRelatedWork W4295106960 @default.
- W4367178834 hasRelatedWork W4300822877 @default.
- W4367178834 isParatext "false" @default.
- W4367178834 isRetracted "false" @default.
- W4367178834 workType "article" @default.