A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices (Q658141): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: biclust / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Tabu search / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Ucinet / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11336-011-9221-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2008360964 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q39494550 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed membership stochastic blockmodels / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonparametric view of network models and Newman–Girvan and other modularities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4336200 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interactive multiobjective programming approach to combinatorial data analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inducing a blockmodel structure of two-mode binary data using seriation procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variable neighborhood search method for generalized blockmodeling of two-mode binary matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer programs for one- and two-mode blockmodeling based on prespecified image matrices for structural and regular equivalence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noising methods for a clique partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indirect Blockmodeling of 3-Way Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning Signed Two-Mode Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bandwidth Packing: A Tabu Search Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Deep Architectures for AI / rank
 
Normal rank
Property / cites work
 
Property / cites work: The tunneling method for global optimization in multidimensional scaling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3713398 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON GROUP REPRESENTATIONS OVER A VALUATION RING / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditions for eliminating intransitivities in binary digraphs† / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic model for social networks† / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exponential Family of Probability Distributions for Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3498136 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3597138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster Analysis: An Application of Lagrangian Relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Community structure in social and biological networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimation and Prediction for Stochastic Blockstructures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design of hybrids for the minimum sum-of-squares clustering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient tabu search procedure for the \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization strategies for two-mode partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4397004 / rank
 
Normal rank

Latest revision as of 20:32, 4 July 2024

scientific article
Language Label Description Also known as
English
A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices
scientific article

    Statements

    A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices (English)
    0 references
    0 references
    0 references
    11 January 2012
    0 references
    clustering
    0 references
    two-mode networks
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references