This study examines how topic analysis improves community detection in rating-based social networks.
problem Finding meaningful communities in rating-based social networks.
method The study considers both the contents and topological structures of social networks to find more meaningful communities.
result Topic analysis enhances the identification of meaningful communities in rating-based social networks.
A framework uses complex networks for image segmentation.
problem Over-segmentation in image segmentation.
method Initial segmentation, adaptive network construction, community detection.
result The proposed framework improves segmentation performance.
New model detects communities in network data from edge nominations.
problem Noise and bias in network data from edge nominations.
method General model for network sampling, spectral clustering, method of moments.
result Community detection improved for network data collected via edge nominations.
Method combines latent space exploration and causal inference to interpret unknown data.
problem Interpreting unknown communication system of sperm whales.
method Causal disentanglement with extreme values (CDEV) combining latent variable manipulation and causal inference.
result Sperm whales encode information using click number, timing regularity, and audio properties.
Improved graph embedding through refined linear transformation and community recovery.
problem Identifying meaningful latent communities in graph data.
method Refined graph encoder embedding via linear transformation, self-training, and latent community recovery.
result Improved vertex embedding and better decision boundaries for vertex classification.
A new modularity density measure improves community detection in heterogeneous networks.
problem Detecting meaningful communities in heterogeneous networks.
method Formulated a novel metric, modularity density, for undirected, weighted networks.
result Maximization of modularity density is free from bias and better at detecting weakly-separated communities.
Improves community detection in directed networks with theoretical guarantees.
problem Degree heterogeneity affects community detection in directed networks.
method Introduced D-SCORE algorithm and established theoretical guarantees for Directed-DCBM.
result Established theoretical guarantees and provided improvements for D-SCORE.
LAGE is a systematic framework developed in Java. The motivation of LAGE is to provide a scalable and parallel solution to reconstruct Gene Regulatory Networks (GRNs) from continuous gene expression data for very large amount of genes. The basic idea of our framework is motivated by the philosophy of divideand-conquer.…
A hierarchical community detection method using recursive partitioning.
problem Finding interpretable and accurate community structures in networks.
method Top-down recursive partitioning starting with spectral clustering.
result The algorithm correctly recovers community trees under mild assumptions.
Paper proposes ADC framework to reduce ViT SL training communication overhead.
problem Reducing communication overhead in ViT SL training.
method Two parallel compression strategies: class-agnostic merging and token discarding.
result Significantly reduces communication overhead without sacrificing accuracy.
Federated learning clusters EMRs to improve mortality and stay predictions.
problem Decentralized, non-IID EMRs complicate centralized machine learning algorithms.
method Introduced CBFL algorithm that clusters EMRs into communities for federated learning.
result CBFL outperforms baseline FL algorithm in ROC AUC, PR AUC, and communication cost.
Two spectral clustering methods for multi-layer networks are analyzed and compared.
problem Community detection in multi-layer networks.
method Sum and debiased sum of squared adjacency matrices for spectral clustering.
result Debiased sum of squared adjacency matrices outperforms sum of adjacency matrices.
Unified framework detects dynamic community structure in brain networks across individuals.
problem Detecting community structure in functional brain networks across multiple subjects and over time.
method Markov-switching stochastic block model (MSS-SBM) for multilayer brain networks.
result Captures dynamic reconfiguration of modular connectivity in brain networks across different task conditions.
Multilayer networks are a useful data structure for simultaneously capturing multiple types of relationships between a set of nodes. In such networks, each relational definition gives rise to a layer. While each layer provides its own set of information, community structure across layers can be collectively utilized to…
Agents are rewarded for influencing others' actions in MARL, improving coordination and communication.
problem Achieving effective coordination and communication in Multi-Agent Reinforcement Learning.
method Rewarding agents for having causal influence over other agents' actions, assessed through counterfactual reasoning.
result Influence rewards lead to enhanced coordination and communication in challenging social dilemma environments.
p-SNE embeds Poisson count data into low dimensions preserving structure.
problem Embedding high-dimensional sparse Poisson data into a low-dimensional space.
method p-SNE (Poisson Stochastic Neighbor Embedding) using KL divergence and Hellinger distance.
result p-SNE recovers meaningful structure in real-world count datasets.
The paper advances OA-biclustering for multi-mode community detection in social networks.
problem Mining meaningful patterns in multi-mode networks for community detection.
method Object-attribute biclustering (OA-biclustering) for 2-mode networks, extended to 3- and 4-mode networks.
result OA-biclusters are suitable for community detection in multi-mode cases, even with unknown number of corresponding n-cliques. The authors argue against the classification of forecasting methods as machine learning or statistical.
problem The classification of forecasting methods as machine learning or statistical limits insights into their appropriateness and effectiveness.
method Alternative characteristics of forecasting methods are proposed to draw meaningful conclusions.
result The distinction between machine learning and statistical forecasting methods is not fundamental.
CASTNet forecasts opioid overdoses using crime patterns.
problem Forecasting opioid overdose occurrences.
method Community-attentive spatio-temporal networks incorporating multi-head attention.
result Superior forecasting performance and interpretable community contributions.
New methods estimate mixed memberships in multi-layer networks.
problem Complex community structure in multi-layer networks.
method Spectral methods using eigen-decomposition of aggregate matrices.
result Theoretical guarantees and empirical validation for mixed membership estimation.
Proposes GNAN model for detecting various network structures.
problem Detecting traditional communities in networks.
method GNAN model combining topology and node-attribute information.
result GNAN detects a broader range of network structures.
The paper assesses fairness in risk score models, focusing on epistemic value.
problem Fairness of risk score models in communicating uncertainty.
method Identified key fairness desiderata, developed metrics for quantitative assessment, and applied methodology in two case studies.
result Introduced a novel calibration error metric for meaningful comparisons between groups of different sizes.
Local decision boundary approximation improves model explanations for complex models.
problem Challenges in explaining complex, opaque machine learning models.
method Train a variational autoencoder to learn a latent space and map it to meaningful attributes. Use these attributes to approximate the local decision boundary and explain model predictions.
result Can recover latent attributes that determine class decisions in a new benchmark data set.
Antipsychotics affect brain network community structure in healthy and schizophrenic individuals.
problem Understanding how antipsychotics affect brain network community structure.
method Network analysis of functional brain networks using mesoscopic response functions.
result Aripiprazole improves community structure in healthy individuals but not in those with schizophrenia.
Graph embeddings from commute networks identify socioeconomic disparities in urban areas.
problem Urban delineation and socioeconomic group identification.
method Graph Neural Network (GNN) for modeling commute networks and deriving node embeddings.
result GNNs effectively capture socioeconomic disparities between urban communities.
Model captures author language diffusion over time.
problem Lack of author identity and temporal context in language models.
method Temporal language model conditioning on author and temporal vectors.
result Beat temporal and non-temporal baselines, learns time-varying author representations.
Being among the easiest ways to find meaningful structure from discrete data, Latent Dirichlet Allocation (LDA) and related component models have been applied widely. They are simple, computationally fast and scalable, interpretable, and admit nonparametric priors. In the currently popular field of network modeling, re…
New VAE limits latent layer information rate for better performance.
problem Improving latent layer information in VAEs.
method Imposes a signal-to-noise ratio on latent layer information.
result BIR-VAE provides meaningful latent representation with specified information rate.
The motivation for this paper is to apply Bayesian structure learning using Model Averaging in large-scale networks. Currently, Bayesian model averaging algorithm is applicable to networks with only tens of variables, restrained by its super-exponential complexity. We present a novel framework, called LSBN(Large-Scale …
New RNN model learns from fMRI data better than existing methods.
problem Difficulties in gathering large fMRI datasets and lack of interpretability.
method Developed a novel RNN-based model that learns to discriminate and generate fMRI data.
result Improves classification learning and produces meaningful functional communities.
Machine learning faces challenges in healthcare data, but offers opportunities.
problem Poorly labeled data, multiple endotypes, and underrepresented healthy individuals.
method Review of existing machine learning methods and challenges in healthcare.
result Opportunities for machine learning in healthcare identified.
This work provides uncertainty intervals for semantic latent variables in disentangled latent spaces.
problem Challenges in providing meaningful uncertainty quantification for semantic information in disentangled latent spaces.
method Uses quantile regression to output heuristic uncertainty intervals, calibrates these intervals to contain true latent values, and propagates them through the generator.
result Reliably communicates semantically meaningful, principled, and instance-adaptive uncertainty in image super-resolution and image completion.
Enhances cooperative multi-task SemCom for distributed users.
problem Performance degradation in cooperative multi-tasking due to negative information transfer.
method Federated learning (FL) with semantic-aware task clustering.
result Constructive cooperation across distributed users with semantic-aware task clustering.
Method predicts missing nodes and metadata from network data.
problem Validation of community detection methods is incomplete.
method Joint generative model for data and metadata, nonparametric Bayesian inference.
result Metadata improves prediction of missing nodes and edges.
New algorithm clusters time-series data faster and more efficiently.
problem Fast clustering of noisy, correlated time-series data.
method Agglomerative Likelihood Clustering (ALC) replaces genetic algorithm with recursive merging.
result ALC reduces compute time and resource usage for large datasets.
Flexible inference model for multilayer networks with heterogeneous data.
problem Complexity of heterogeneous data in networked datasets.
method Probabilistic generative model using Bayesian framework and Laplace matching.
result Effective detection of overlapping community structures and prediction tasks.
DPFact preserves privacy while collaboratively factorizing EHR tensors.
problem Privacy-preserving tensor factorization for EHRs.
method Differential privacy and collaborative learning.
result DPFact achieves higher accuracy and efficiency under privacy constraints.
A distributed algorithm for training graph convolutional networks.
problem Training graph convolutional networks with sparse network topology and distributed agents.
method Formulate inference and optimization in a distributed scenario, propose a gradient descent procedure, and design communication topology.
result Convergence to stationary solutions of the GCN training problem under mild conditions.
Recent anomaly detection benchmarks are flawed, potentially misleading progress.
problem Flawed benchmark datasets create misleading progress reports.
method Identified four flaws in benchmark datasets and introduced a new archive.
result Published comparisons may be unreliable due to flaws in benchmark datasets.
Algorithm reduces regret in multi-player bandits with unknown collision rewards.
problem Reducing regret in multi-player multi-armed bandits with unknown collision rewards.
method Proposes an algorithm that combines a modified successive elimination strategy with a communication protocol to estimate suboptimality gaps and coordinate among players.
result Achieves logarithmic regret for the problem when collision reward is unknown.
EF21 improves convergence in distributed machine learning models.
problem Improving convergence in distributed machine learning models.
method Proposes EF21, a new error feedback mechanism.
result EF21 achieves a fast O(1/T) convergence rate for smooth nonconvex problems. WSCE combines individual clustering results to improve performance.
problem Improving the performance of CES by addressing diversity metrics and thresholding.
method WSCE uses modularity for diversity estimation and combines results without thresholding.
result WSCE outperforms state-of-the-art methods on varied data sets.
Integrates learning and optimization on graphs, improving prediction accuracy.
problem Combining learning and optimization on graphs with partially observed data.
method Proposes a decision-focused learning approach integrating a differentiable proxy for optimization problems.
result ClusterNet system outperforms pure end-to-end and standard approaches.
New approach to meaningful and robust algorithmic recourse.
problem Ineffective and unmeaningful algorithmic recourse explanations.
method Meaningful Algorithmic Recourse (MAR) and Effective Algorithmic Recourse (EAR).
result Proposes new constraints for algorithmic recourse that improve both prediction and target.
DAOR efficiently embeds graphs without tuning, improving speed and interpretability.
problem Graph embedding limitations in resource usage, interpretability, and parameter dependence.
method DAOR uses community detection to produce robust, interpretable embeddings without manual tuning.
result DAOR outperforms state-of-the-art techniques on node classification and link prediction.
CRC method provides tighter uncertainty intervals for CT images.
problem Expressing uncertainty in CT images in clinically meaningful terms.
method Semantically adaptive CRC procedure leveraging length minimization.
result Valid coverage of ground-truth images with tighter uncertainty intervals.
Much of human knowledge sits in large databases of unstructured text. Leveraging this knowledge requires algorithms that extract and record metadata on unstructured text documents. Assigning topics to documents will enable intelligent search, statistical characterization, and meaningful classification. Latent Dirichlet…
Time series of graphs are increasingly prevalent in modern data and pose unique challenges to visual exploration and pattern extraction. This paper describes the development and application of matrix factorizations for exploration and time-varying community detection in time-evolving graph sequences. The matrix factori…