Michael Brusco
Biographic Data
| ID | 3738967 |
|---|---|
| NAME | Michael Brusco |
| GIVEN NAMES | Michael |
| FAMILY NAME | Brusco |
| SIGNATURE | BRUSCO M |
| AFFILIATIONS | Florida State University, Tallassee, FL, USA |
| VERIFIED | No |
| TOTAL WORKS | 9 |
| TOTAL CITATIONS | 15 |
| AUTHOR COUNT | 9 |
| EDITOR COUNT | 0 |
| FIRST PUBLICATION YEAR | 2010 |
| LATEST PUBLICATION YEAR | 2024 |
| H-INDEX | 3 |
Improving the Walktrap Algorithm Using K -Means Clustering
The walktrap algorithm is one of the most popular community-detection methods in psychological research. Several simulation studies have shown that it is often effective at determining the correct number of communities and assigning items to their proper community. Nevertheless, it is important to recognize that the walktrap algorithm relies on hierarchical clustering because it was originally developed for networks much larger than those encount…
Deterministic Blockmodeling of Two-Mode Binary Networks Using a Two-Mode KL -Median Heuristic
Deterministic blockmodeling of a two-mode binary network matrix based on structural equivalence is a well-known problem in the social network literature. Whether implemented in a standalone fashion, or embedded within a metaheuristic framework, a popular relocation heuristic (RH) has served as the principal solution tool for this problem. In this paper, we establish that a two-mode KL -median heuristic (TMKLMedH) seeks to optimize the same criter…
Psychometrics
A real-coded genetic algorithm for two-mode KL-means partitioning with application to homogeneity blockmodeling
An Exact Algorithm for Blockmodeling of Two-Mode Network Data
We consider problems where relationships between two sets (or modes) of objects are available in the form of a binary matrix with elements of 1 (0) indicating a bond (lack of a bond) between corresponding row and column objects. The goal is to establish a partition of the row objects and, simultaneously, a partition of the column objects to form blocks that consist of either exclusively 1s or exclusively 0s to the greatest extent possible. This t…
A variable neighborhood search method for a two-mode blockmodeling problem in social network analysis
This paper presents a variable neighborhood search (VNS) algorithm that is specially designed for the blockmodeling of two-mode binary network matrices in accordance with structural equivalence. Computational results for 768 synthetic test networks revealed that the VNS heuristic outperformed a relocation heuristic (RH) and a tabu search (TS) method for the same problem. Next, the three heuristics were applied to two-mode network data pertaining …
Analysis of two-mode network data using nonnegative matrix factorization
Two Algorithms for Relaxed Structural Balance Partitioning
Understanding social phenomena with the help of mathematical models requires a coherent combination of theory, models, and data together with using valid data analytic methods. The study of social networks through the use of mathematical models is no exception. The intuitions of structural balance were formalized and led to a pair of remarkable theorems giving the nature of partition structures for balanced signed networks. Algorithms for partiti…
An exact algorithm for a core/periphery bipartitioning problem
A variable neighborhood search method for a two-mode blockmodeling problem in social network analysis
This paper presents a variable neighborhood search (VNS) algorithm that is specially designed for the blockmodeling of two-mode binary network matrices in accordance with structural equivalence. Computational results for 768 synthetic test networks revealed that the VNS heuristic outperformed a relocation heuristic (RH) and a tabu search (TS) method for the same problem. Next, the three heuristics were applied to two-mode network data pertaining …
An Exact Algorithm for Blockmodeling of Two-Mode Network Data
We consider problems where relationships between two sets (or modes) of objects are available in the form of a binary matrix with elements of 1 (0) indicating a bond (lack of a bond) between corresponding row and column objects. The goal is to establish a partition of the row objects and, simultaneously, a partition of the column objects to form blocks that consist of either exclusively 1s or exclusively 0s to the greatest extent possible. This t…
Two Algorithms for Relaxed Structural Balance Partitioning
Understanding social phenomena with the help of mathematical models requires a coherent combination of theory, models, and data together with using valid data analytic methods. The study of social networks through the use of mathematical models is no exception. The intuitions of structural balance were formalized and led to a pair of remarkable theorems giving the nature of partition structures for balanced signed networks. Algorithms for partiti…
Deterministic Blockmodeling of Two-Mode Binary Networks Using a Two-Mode KL -Median Heuristic
Deterministic blockmodeling of a two-mode binary network matrix based on structural equivalence is a well-known problem in the social network literature. Whether implemented in a standalone fashion, or embedded within a metaheuristic framework, a popular relocation heuristic (RH) has served as the principal solution tool for this problem. In this paper, we establish that a two-mode KL -median heuristic (TMKLMedH) seeks to optimize the same criter…
An exact algorithm for a core/periphery bipartitioning problem
Analysis of two-mode network data using nonnegative matrix factorization
Two Algorithms for Relaxed Structural Balance Partitioning
Understanding social phenomena with the help of mathematical models requires a coherent combination of theory, models, and data together with using valid data analytic methods. The study of social networks through the use of mathematical models is no exception. The intuitions of structural balance were formalized and led to a pair of remarkable theorems giving the nature of partition structures for balanced signed networks. Algorithms for partiti…
An Exact Algorithm for Blockmodeling of Two-Mode Network Data
We consider problems where relationships between two sets (or modes) of objects are available in the form of a binary matrix with elements of 1 (0) indicating a bond (lack of a bond) between corresponding row and column objects. The goal is to establish a partition of the row objects and, simultaneously, a partition of the column objects to form blocks that consist of either exclusively 1s or exclusively 0s to the greatest extent possible. This t…
A variable neighborhood search method for a two-mode blockmodeling problem in social network analysis
This paper presents a variable neighborhood search (VNS) algorithm that is specially designed for the blockmodeling of two-mode binary network matrices in accordance with structural equivalence. Computational results for 768 synthetic test networks revealed that the VNS heuristic outperformed a relocation heuristic (RH) and a tabu search (TS) method for the same problem. Next, the three heuristics were applied to two-mode network data pertaining …
Psychometrics
A real-coded genetic algorithm for two-mode KL-means partitioning with application to homogeneity blockmodeling
Deterministic Blockmodeling of Two-Mode Binary Networks Using a Two-Mode KL -Median Heuristic
Deterministic blockmodeling of a two-mode binary network matrix based on structural equivalence is a well-known problem in the social network literature. Whether implemented in a standalone fashion, or embedded within a metaheuristic framework, a popular relocation heuristic (RH) has served as the principal solution tool for this problem. In this paper, we establish that a two-mode KL -median heuristic (TMKLMedH) seeks to optimize the same criter…
Improving the Walktrap Algorithm Using K -Means Clustering
The walktrap algorithm is one of the most popular community-detection methods in psychological research. Several simulation studies have shown that it is often effective at determining the correct number of communities and assigning items to their proper community. Nevertheless, it is important to recognize that the walktrap algorithm relies on hierarchical clustering because it was originally developed for networks much larger than those encount…
Computer Science (9 works) · Algorithm (8 works) · Mathematics (8 works) · Complex Network Analysis Techniques (7 works) · Artificial Intelligence (6 works) · Theoretical Computer Science (5 works) · Data mining (4 works) · Heuristic (4 works) · Mathematical optimization (4 works) · Binary number (3 works)