anticlust (Q57425): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Martin Papenberg (Q78726) Tag: Reverted |
Added link to MaRDI item. |
||||||||||||||
(23 intermediate revisions by 2 users not shown) | |||||||||||||||
Property / last update | |||||||||||||||
| |||||||||||||||
Property / last update: 2 May 2023 / rank | |||||||||||||||
Property / maintained by | |||||||||||||||
Property / maintained by: Martin Papenberg / rank | |||||||||||||||
Property / copyright license | |||||||||||||||
Property / copyright license: MIT license / rank | |||||||||||||||
Property / copyright license | |||||||||||||||
Property / copyright license: File License / rank | |||||||||||||||
Property / depends on software | |||||||||||||||
Property / depends on software: R / rank | |||||||||||||||
Property / imports | |||||||||||||||
Property / imports: Matrix / rank | |||||||||||||||
Property / imports | |||||||||||||||
Property / imports: RANN / rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Using anticlustering to partition data sets into equivalent parts. / rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Combining diversity and dispersion criteria for anticlustering: A bicriterion approach / rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: k-plus Anticlustering: An Improved k-means Criterion for Maximizing Between-Group Similarity / rank | |||||||||||||||
Property / software version identifier | |||||||||||||||
0.5.0 | |||||||||||||||
Property / software version identifier: 0.5.0 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / software version identifier: 0.5.0 / qualifier | |||||||||||||||
publication date: 29 June 2020
| |||||||||||||||
Property / software version identifier | |||||||||||||||
0.5.3 | |||||||||||||||
Property / software version identifier: 0.5.3 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / software version identifier: 0.5.3 / qualifier | |||||||||||||||
publication date: 25 September 2020
| |||||||||||||||
Property / software version identifier | |||||||||||||||
0.5.6 | |||||||||||||||
Property / software version identifier: 0.5.6 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / software version identifier: 0.5.6 / qualifier | |||||||||||||||
publication date: 24 November 2020
| |||||||||||||||
Property / software version identifier | |||||||||||||||
0.6.0 | |||||||||||||||
Property / software version identifier: 0.6.0 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / software version identifier: 0.6.0 / qualifier | |||||||||||||||
publication date: 1 December 2021
| |||||||||||||||
Property / software version identifier | |||||||||||||||
0.6.1 | |||||||||||||||
Property / software version identifier: 0.6.1 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / software version identifier: 0.6.1 / qualifier | |||||||||||||||
publication date: 7 December 2021
| |||||||||||||||
Property / software version identifier | |||||||||||||||
0.7.0 | |||||||||||||||
Property / software version identifier: 0.7.0 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / software version identifier: 0.7.0 / qualifier | |||||||||||||||
publication date: 15 July 2023
| |||||||||||||||
Property / software version identifier | |||||||||||||||
0.8.0-1 | |||||||||||||||
Property / software version identifier: 0.8.0-1 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / software version identifier: 0.8.0-1 / qualifier | |||||||||||||||
publication date: 25 October 2023
| |||||||||||||||
Property / software version identifier | |||||||||||||||
0.8.0 | |||||||||||||||
Property / software version identifier: 0.8.0 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / software version identifier: 0.8.0 / qualifier | |||||||||||||||
publication date: 14 September 2023
| |||||||||||||||
Property / software version identifier | |||||||||||||||
0.8.1 | |||||||||||||||
Property / software version identifier: 0.8.1 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / software version identifier: 0.8.1 / qualifier | |||||||||||||||
publication date: 26 October 2023
| |||||||||||||||
Property / instance of | |||||||||||||||
Property / instance of: R package / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / programmed in | |||||||||||||||
Property / programmed in: R / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / maintained by | |||||||||||||||
Property / maintained by: Martin Papenberg / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / last update | |||||||||||||||
26 October 2023
| |||||||||||||||
Property / last update: 26 October 2023 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / description | |||||||||||||||
The method of anticlustering partitions a pool of elements into groups (i.e., anticlusters) with the goal of maximizing between-group similarity or within-group heterogeneity. The anticlustering approach thereby reverses the logic of cluster analysis that strives for high within-group homogeneity and clear separation between groups. Computationally, anticlustering is accomplished by maximizing instead of minimizing a clustering objective function, such as the intra-cluster variance (used in k-means clustering) or the sum of pairwise distances within clusters. The main function anticlustering() gives access to exact and heuristic anticlustering methods described in Papenberg and Klau (2021; <doi:10.1037/met0000301>), Brusco et al. (2020; <doi:10.1111/bmsp.12186>), and Papenberg (2023; <doi:10.1111/bmsp.12315>). The exact algorithms require that an integer linear programming solver is installed, either the GNU linear programming kit (<https://www.gnu.org/software/glpk/glpk.html>) together with the interface package 'Rglpk' (<https://cran.R-project.org/package=Rglpk>), or the SYMPHONY ILP solver (<https://github.com/coin-or/SYMPHONY>) together with the interface package 'Rsymphony' (<https://cran.r-project.org/package=Rsymphony>). Full access to the bicriterion anticlustering method proposed by Brusco et al. (2020) is given via the function bicriterion_anticlustering(), while kplus_anticlustering() implements the full functionality of the k-plus anticlustering approach proposed by Papenberg (2023). Some other functions are available to solve classical clustering problems. The function balanced_clustering() applies a cluster analysis under size constraints, i.e., creates equal-sized clusters. The function matching() can be used for (unrestricted, bipartite, or K-partite) matching. The function wce() can be used optimally solve the (weighted) cluster editing problem, also known as correlation clustering, clique partitioning problem or transitivity clustering. | |||||||||||||||
Property / description: The method of anticlustering partitions a pool of elements into groups (i.e., anticlusters) with the goal of maximizing between-group similarity or within-group heterogeneity. The anticlustering approach thereby reverses the logic of cluster analysis that strives for high within-group homogeneity and clear separation between groups. Computationally, anticlustering is accomplished by maximizing instead of minimizing a clustering objective function, such as the intra-cluster variance (used in k-means clustering) or the sum of pairwise distances within clusters. The main function anticlustering() gives access to exact and heuristic anticlustering methods described in Papenberg and Klau (2021; <doi:10.1037/met0000301>), Brusco et al. (2020; <doi:10.1111/bmsp.12186>), and Papenberg (2023; <doi:10.1111/bmsp.12315>). The exact algorithms require that an integer linear programming solver is installed, either the GNU linear programming kit (<https://www.gnu.org/software/glpk/glpk.html>) together with the interface package 'Rglpk' (<https://cran.R-project.org/package=Rglpk>), or the SYMPHONY ILP solver (<https://github.com/coin-or/SYMPHONY>) together with the interface package 'Rsymphony' (<https://cran.r-project.org/package=Rsymphony>). Full access to the bicriterion anticlustering method proposed by Brusco et al. (2020) is given via the function bicriterion_anticlustering(), while kplus_anticlustering() implements the full functionality of the k-plus anticlustering approach proposed by Papenberg (2023). Some other functions are available to solve classical clustering problems. The function balanced_clustering() applies a cluster analysis under size constraints, i.e., creates equal-sized clusters. The function matching() can be used for (unrestricted, bipartite, or K-partite) matching. The function wce() can be used optimally solve the (weighted) cluster editing problem, also known as correlation clustering, clique partitioning problem or transitivity clustering. / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / author | |||||||||||||||
Property / author: Martin Papenberg / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / copyright license | |||||||||||||||
Property / copyright license: MIT license / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / copyright license | |||||||||||||||
Property / copyright license: File License / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / copyright license: File License / qualifier | |||||||||||||||
Property / imports | |||||||||||||||
Property / imports: Matrix / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / imports | |||||||||||||||
Property / imports: RANN / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / imports: RANN / qualifier | |||||||||||||||
software version identifier: ≥ 2.6.0 | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Using anticlustering to partition data sets into equivalent parts. / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Combining diversity and dispersion criteria for anticlustering: A bicriterion approach / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: K‐Plus anticlustering: An improved k‐means criterion for maximizing between‐group similarity / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / depends on software | |||||||||||||||
Property / depends on software: R / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / depends on software: R / qualifier | |||||||||||||||
software version identifier: ≥ 3.6.0 | |||||||||||||||
Property / MaRDI profile type | |||||||||||||||
Property / MaRDI profile type: MaRDI software profile / rank | |||||||||||||||
Normal rank | |||||||||||||||
links / mardi / name | links / mardi / name | ||||||||||||||
Latest revision as of 19:56, 12 March 2024
Subset Partitioning via Anticlustering
Language | Label | Description | Also known as |
---|---|---|---|
English | anticlust |
Subset Partitioning via Anticlustering |
Statements
26 October 2023
0 references
The method of anticlustering partitions a pool of elements into groups (i.e., anticlusters) with the goal of maximizing between-group similarity or within-group heterogeneity. The anticlustering approach thereby reverses the logic of cluster analysis that strives for high within-group homogeneity and clear separation between groups. Computationally, anticlustering is accomplished by maximizing instead of minimizing a clustering objective function, such as the intra-cluster variance (used in k-means clustering) or the sum of pairwise distances within clusters. The main function anticlustering() gives access to exact and heuristic anticlustering methods described in Papenberg and Klau (2021; <doi:10.1037/met0000301>), Brusco et al. (2020; <doi:10.1111/bmsp.12186>), and Papenberg (2023; <doi:10.1111/bmsp.12315>). The exact algorithms require that an integer linear programming solver is installed, either the GNU linear programming kit (<https://www.gnu.org/software/glpk/glpk.html>) together with the interface package 'Rglpk' (<https://cran.R-project.org/package=Rglpk>), or the SYMPHONY ILP solver (<https://github.com/coin-or/SYMPHONY>) together with the interface package 'Rsymphony' (<https://cran.r-project.org/package=Rsymphony>). Full access to the bicriterion anticlustering method proposed by Brusco et al. (2020) is given via the function bicriterion_anticlustering(), while kplus_anticlustering() implements the full functionality of the k-plus anticlustering approach proposed by Papenberg (2023). Some other functions are available to solve classical clustering problems. The function balanced_clustering() applies a cluster analysis under size constraints, i.e., creates equal-sized clusters. The function matching() can be used for (unrestricted, bipartite, or K-partite) matching. The function wce() can be used optimally solve the (weighted) cluster editing problem, also known as correlation clustering, clique partitioning problem or transitivity clustering.
0 references