4.7 Article

Detecting hierarchical structure of community members in social networks

Journal

KNOWLEDGE-BASED SYSTEMS
Volume 87, Issue -, Pages 3-15

Publisher

ELSEVIER
DOI: 10.1016/j.knosys.2015.05.026

Keywords

Social network; Community detection; Hierarchical structure; Random walk; Linear regression

Funding

  1. Natural Science Foundation of China [60903071]
  2. National Basic Research Program of China (973 Program) [2013CB329605]
  3. Specialized Research Fund for the Doctoral Program of Higher Education of China
  4. Training Program of the Major Project of BIT

Ask authors/readers for more resources

Current methods often predefine fixed roles of members and only detect fixed hierarchy structures that are not consistent with real-world communities; methods with hand-crafted thresholds bring difficulties in real applications, while choosing the community corresponding to the maximal belonging coefficient for each node results in a single boundary and neglects the multi-resolution of communities. In order to solve the limitations above, we propose a novel structure to dig finer information by partitioning the members into several levels according to their belonging coefficients. We call this novel structure Hierarchical Structure of Members (HSM) and discuss its properties in continuity, comparability, consistency and stability which reveal the multi-resolution of community as well as the intra-relations among members. We propose a two-phrase method, Random Walk and Linear Regression (RWLR), to detect HSM. The method measures the belonging coefficients of members by random walk and then divides the members into multiple segments by linear regression. Experiments show that members in the same level hold the same properties and HSM reveals multi-resolution of community. Besides, the comparison in benchmarks shows the efficiency in community detection. Finally, we apply HSM to analyze social networks, including visualization of community structures in large social networks and interactive recommendations in Amazon network. (C) 2015 Elsevier B.V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

Article Operations Research & Management Science

Adaptive seeding for profit maximization in social networks

Chuangen Gao, Shuyang Gu, Jiguo Yu, Hai Du, Weili Wu

Summary: This paper discusses the benefits of interactions among activated nodes in social networks and proposes an adaptive seeding strategy for profit maximization. The study introduces an adaptive sandwich policy for an approximation solution based on the sandwich strategy. The effectiveness of the proposed algorithm is verified through real data sets.

JOURNAL OF GLOBAL OPTIMIZATION (2022)

Article Computer Science, Theory & Methods

Union acceptable profit maximization in social networks

Guoyao Rao, Yongcai Wang, Wenping Chen, Deying Li, Weili Wu

Summary: Online social networks have had a profound impact on our lives, leading to an increase in research on social influence. Previous studies on social influence have primarily focused on individual influence, but in many cases, influencing an important group can bring greater profits than directly influencing individuals. We propose a model called the Union Acceptable Profit Problem (UAPM) to maximize the probability of a union being acceptable and present efficient estimation methods and algorithms to solve the problem. We evaluate the performance of our algorithms using real-world social network datasets.

THEORETICAL COMPUTER SCIENCE (2022)

Article Mathematics

Influence Maximization Based on Snapshot Prediction in Dynamic Online Social Networks

Lin Zhang, Kan Li

Summary: In this study, a novel framework called Influence Maximization based on Prediction and Replacement (IMPR) is proposed to address the influence maximization problem in dynamic online social networks. The framework utilizes historical network snapshot information to predict upcoming network snapshots, and employs a fast replacement algorithm to solve the seed node problem. Experimental results demonstrate the promising performance of the proposed scheme.

MATHEMATICS (2022)

Article Engineering, Multidisciplinary

Continuous Influence-Based Community Partition for Social Networks

Qiufen Ni, Jianxiong Guo, Weili Wu, Huan Wang, Jigang Wu

Summary: Community partition is crucial in social networks, particularly in the face of network growth and increased data and applications. This study focuses on the community partition problem under the Linear Threshold (LT) model, aiming to maximize influence propagation within each community. The proposed continuous greedy algorithm, which exploits the properties of the relaxed function, is able to effectively improve influence spread and accuracy of the community partition. Theoretical analysis demonstrates a 1 - 1/e approximation ratio for the algorithm, while extensive experiments on real-world online social networks datasets validate its performance.

IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING (2022)

Review Mathematics, Applied

Social network analysis and applications: A review of the broad research aspects of social network structure

Priyanshi Garg, Weili Wu

Summary: This paper explores the use of social media in generating Online Social Networks (OSNs) and the various research tasks associated with them, such as community detection, link prediction, and influence modeling. Different models for modeling influence diffusion processes are discussed, and the applications of influence maximization and rumor blocking in different scenarios are examined. The concept of viral marketing is also explored.

DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS (2022)

Article Computer Science, Artificial Intelligence

Self-supervised method for 3D human pose estimation with consistent shape and viewpoint factorization

Zhichao Ma, Kan Li, Yang Li

Summary: This article introduces a self-supervised method that can train a 3D human pose estimation network without any extra 3D pose annotations. By fully disentangling the camera viewpoint information and 3D human shape, the method overcomes the projection ambiguity problem and utilizes a hierarchical dictionary for stable canonical reconstruction.

APPLIED INTELLIGENCE (2023)

Review Mathematics, Applied

Graph representation learning for popularity prediction problem: A survey

Tiantian Chen, Jianxiong Guo, Weili Wu

Summary: Online social platforms have grown rapidly in the past decade and play a crucial role in communication and information sharing. Understanding the mechanisms and consequences of information diffusion is important for viral marketing and advertising. The development of neural networks has led to more effective graph representation learning methods.

DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS (2022)

Article Computer Science, Hardware & Architecture

Reliable Traffic Monitoring Mechanisms Based on Blockchain in Vehicular Networks

Jianxiong Guo, Xingjian Ding, Weili Wu

Summary: Real-time traffic monitoring is essential in smart cities for understanding traffic conditions and preventing accidents. This article proposes a reliable and efficient traffic monitoring system that integrates blockchain and IoT technologies, crowdsourcing tasks to vehicles. The system includes a lightweight blockchain-based information trading framework and auction mechanism to incentivize vehicle participation and ensure budget constraints. Numerical simulations confirm the reliability and efficiency of the framework and algorithms.

IEEE TRANSACTIONS ON RELIABILITY (2022)

Article Automation & Control Systems

A k-Hop Collaborate Game Model: Extended to Community Budgets and Adaptive Nonsubmodularity

Jianxiong Guo, Weili Wu

Summary: This study addresses the revenue maximization problem in social networks, utilizing adaptive seeding strategies and a collaboration game model to compute revenue based on user activities. It introduces the RM problem under size and community budget constraints, and proposes RMSBSolver and RMCBSolver to address the problems in various scenarios with theoretical guarantees. Additionally, data-dependent approximation ratios are provided for general nonsubmodular cases, and the effectiveness and accuracy of the solutions are demonstrated through experiments on real datasets.

IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS (2022)

Article Computer Science, Information Systems

Adaptive multi-feature budgeted profit maximization in social networks

Tiantian Chen, Jianxiong Guo, Weili Wu

Summary: Online social networks are important platforms for viral marketing, but existing research mainly focuses on the diffusion of products with single features. However, in reality, products may have multiple features that spread independently. Based on this, we propose the multi-feature budgeted profit maximization problem and consider adaptive models for solving it. We conduct experiments to compare our proposed strategies with existing ones, and the results demonstrate the efficiency and superiority of our approaches.

SOCIAL NETWORK ANALYSIS AND MINING (2022)

Article Computer Science, Artificial Intelligence

Bold driver and static restart fused adaptive momentum for visual question answering

Shengdong Li, Chuanwen Luo, Yuqing Zhu, Weili Wu

Summary: Stacked attention networks (SANs) are a classic model for visual question answering (VQA) and have effectively promoted research progress in VQA. This paper proposes a method called bold driver and static restart fused adaptive momentum (BDSRM) to optimize SANs, by fusing bold driver and static restart (BDSR) into momentum. The experiments demonstrate that BDSRM outperforms state-of-the-art optimization algorithms on SANs.

KNOWLEDGE AND INFORMATION SYSTEMS (2023)

Article Computer Science, Cybernetics

Influence-Based Community Partition With Sandwich Method for Social Networks

Qiufen Ni, Jianxiong Guo, Weili Wu, Huan Wang

Summary: This article focuses on the community partition problem in social networks and formulates it as a combinatorial optimization problem. Continuous greedy algorithms and discrete implementations are proposed to solve the upper and lower bound problems, achieving a good approximation ratio. The effectiveness and advantages of the proposed method are demonstrated through experiments on real datasets.

IEEE TRANSACTIONS ON COMPUTATIONAL SOCIAL SYSTEMS (2023)

Proceedings Paper Computer Science, Artificial Intelligence

Diversifying Neural Dialogue Generation via Negative Distillation

Yiwei Li, Shaoxiong Feng, Bin Sun, Kan Li

Summary: The paper introduces a novel negative training paradigm called negative distillation to address the generic response problem in generative dialogue models. By introducing a negative teacher model and requiring the student model to maximize the distance with multi-level negative knowledge, the method significantly improves upon previous negative training approaches.

NAACL 2022: THE 2022 CONFERENCE OF THE NORTH AMERICAN CHAPTER OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS: HUMAN LANGUAGE TECHNOLOGIES (2022)

Proceedings Paper Computer Science, Artificial Intelligence

Hierarchical Inductive Transfer for Continual Dialogue Learning

Shaoxiong Feng, Xuancheng Ren, Kan Li, Xu Sun

Summary: In this work, a hierarchical inductive transfer framework is proposed to learn and deploy dialogue skills continually and efficiently. By introducing adapter modules and using general knowledge in the base adapter to alleviate knowledge interference between tasks, the framework achieves comparable performance on embedded devices.

FINDINGS OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS (ACL 2022) (2022)

Article Telecommunications

An Architecture for Distributed Energies Trading in Byzantine-Based Blockchains

Jianxiong Guo, Xingjian Ding, Weili Wu

Summary: With the development of smart cities, a large distributed network has been formed between cities, which raises the challenge of secure and efficient energy trading. In this paper, a blockchain-based multiple energies trading system is proposed, using a smart contract and a new byzantine-based consensus mechanism. The model and algorithms are validated using numerical simulations, demonstrating their correctness and efficiency.

IEEE TRANSACTIONS ON GREEN COMMUNICATIONS AND NETWORKING (2022)

Article Computer Science, Artificial Intelligence

Confidence-based and sample-reweighted test-time adaptation

Hao Yang, Min Wang, Zhengfei Yu, Hang Zhang, Jinshen Jiang, Yun Zhou

Summary: In this paper, a novel method called CSTTA is proposed for test time adaptation (TTA), which utilizes confidence-based optimization and sample reweighting to better utilize sample information. Extensive experiments demonstrate the effectiveness of the proposed method.

KNOWLEDGE-BASED SYSTEMS (2024)

Article Computer Science, Artificial Intelligence

A novel method for generating a canonical basis for decision implications based on object-induced three-way operators

Jin Liu, Ju-Sheng Mi, Dong-Yun Niu

Summary: This article focuses on a novel method for generating a canonical basis for decision implications based on object-induced operators (OE operators). The logic of decision implication based on OE operators is described, and a method for obtaining the canonical basis for decision implications is given. The completeness, nonredundancy, and optimality of the canonical basis are proven. Additionally, a method for generating true premises based on OE operators is proposed.

KNOWLEDGE-BASED SYSTEMS (2024)

Review Computer Science, Artificial Intelligence

Efficient utilization of pre-trained models: A review of sentiment analysis via prompt learning

Kun Bu, Yuanchao Liu, Xiaolong Ju

Summary: This paper discusses the importance of sentiment analysis and pre-trained models in natural language processing, and explores the application of prompt learning. The research shows that prompt learning is more suitable for sentiment analysis tasks and can achieve good performance.

KNOWLEDGE-BASED SYSTEMS (2024)

Article Computer Science, Artificial Intelligence

M-EDEM: A MNN-based Empirical Decomposition Ensemble Method for improved time series forecasting

Xiangjun Cai, Dagang Li

Summary: This paper presents a new decomposition mechanism based on learned decomposition mapping. By using a neural network to learn the relationship between original time series and decomposed results, the repetitive computation overhead during rolling decomposition is relieved. Additionally, extended mapping and partial decomposition methods are proposed to alleviate boundary effects on prediction performance. Comparative studies demonstrate that the proposed method outperforms existing RDEMs in terms of operation speed and prediction accuracy.

KNOWLEDGE-BASED SYSTEMS (2024)

Article Computer Science, Artificial Intelligence

Privacy-preserving trust management method based on blockchain for cross-domain industrial IoT

Xu Wu, Yang Liu, Jie Tian, Yuanpeng Li

Summary: This paper proposes a blockchain-based privacy-preserving trust management architecture, which adopts federated learning to train task-specific trust models and utilizes differential privacy to protect device privacy. In addition, a game theory-based incentive mechanism and a parallel consensus protocol are proposed to improve the accuracy of trust computing and the efficiency of consensus.

KNOWLEDGE-BASED SYSTEMS (2024)

Article Computer Science, Artificial Intelligence

MV-ReID: 3D Multi-view Transformation Network for Occluded Person Re-Identification

Zaiyang Yu, Prayag Tiwari, Luyang Hou, Lusi Li, Weijun Li, Limin Jiang, Xin Ning

Summary: This study introduces a 3D view-based approach that effectively handles occlusions and leverages the geometric information of 3D objects. The proposed method achieves state-of-the-art results on occluded ReID tasks and exhibits competitive performance on holistic ReID tasks.

KNOWLEDGE-BASED SYSTEMS (2024)

Article Computer Science, Artificial Intelligence

City-scale continual neural semantic mapping with three-layer sampling and panoptic representation

Yongliang Shi, Runyi Yang, Zirui Wu, Pengfei Li, Caiyun Liu, Hao Zhao, Guyue Zhou

Summary: Neural implicit representations have gained attention due to their expressive, continuous, and compact properties. However, there is still a lack of research on city-scale continual implicit dense mapping based on sparse LiDAR input. In this study, a city-scale continual neural mapping system with a panoptic representation is developed, incorporating environment-level and instance-level modeling. A tailored three-layer sampling strategy and category-specific prior are proposed to address the challenges of representing geometric information in city-scale space and achieving high fidelity mapping of instances under incomplete observation.

KNOWLEDGE-BASED SYSTEMS (2024)

Article Computer Science, Artificial Intelligence

MDSSN: An end-to-end deep network on triangle mesh parameterization

Ruihan Hu, Zhi-Ri Tang, Rui Yang, Zhongjie Wang

Summary: Mesh data is crucial for 3D computer vision applications worldwide, but traditional deep learning frameworks have struggled with handling meshes. This paper proposes MDSSN, a simple mesh computation framework that models triangle meshes and represents their shape using face-based and edge-based Riemannian graphs. The framework incorporates end-to-end operators inspired by traditional deep learning frameworks, and includes dedicated modules for addressing challenges in mesh classification and segmentation tasks. Experimental results demonstrate that MDSSN outperforms other state-of-the-art approaches.

KNOWLEDGE-BASED SYSTEMS (2024)

Article Computer Science, Artificial Intelligence

Semi-supervised learning with missing values imputation

Buliao Huang, Yunhui Zhu, Muhammad Usman, Huanhuan Chen

Summary: This paper proposes a novel semi-supervised conditional normalizing flow (SSCFlow) algorithm that combines unsupervised imputation and supervised classification. By estimating the conditional distribution of incomplete instances, SSCFlow facilitates imputation and classification simultaneously, addressing the issue of separated tasks ignoring data distribution and label information in traditional methods.

KNOWLEDGE-BASED SYSTEMS (2024)

Article Computer Science, Artificial Intelligence

Emotion-and-knowledge grounded response generation in an open-domain dialogue setting

Deeksha Varshney, Asif Ekbal, Erik Cambria

Summary: This paper focuses on the neural-based interactive dialogue system that aims to engage and retain humans in long-lasting conversations. It proposes a new neural generative model that combines step-wise co-attention, self-attention-based transformer network, and an emotion classifier to control emotion and knowledge transfer during response generation. The results from quantitative, qualitative, and human evaluation show that the proposed models can generate natural and coherent sentences, capturing essential facts with significant improvement over emotional content.

KNOWLEDGE-BASED SYSTEMS (2024)

Article Computer Science, Artificial Intelligence

MvTS-library: An open library for deep multivariate time series forecasting

Junchen Ye, Weimiao Li, Zhixin Zhang, Tongyu Zhu, Leilei Sun, Bowen Du

Summary: Modeling multivariate time series has long been a topic of interest for scholars in various fields. This paper introduces MvTS, an open library based on Pytorch, which provides a unified framework for implementing and evaluating these models. Extensive experiments on public datasets demonstrate the effectiveness and universality of the models reproduced by MvTS.

KNOWLEDGE-BASED SYSTEMS (2024)

Article Computer Science, Artificial Intelligence

An adaptive hybrid mutated differential evolution feature selection method for low and high-dimensional medical datasets

Reham R. Mostafa, Ahmed M. Khedr, Zaher Al Aghbari, Imad Afyouni, Ibrahim Kamel, Naveed Ahmed

Summary: Feature selection is crucial in classification procedures, but it faces challenges in high-dimensional datasets. To overcome these challenges, this study proposes an Adaptive Hybrid-Mutated Differential Evolution method that incorporates the mechanics of the Spider Wasp Optimization algorithm and the concept of Enhanced Solution Quality. Experimental results demonstrate the effectiveness of the method in terms of accuracy and convergence speed, and it outperforms contemporary cutting-edge algorithms.

KNOWLEDGE-BASED SYSTEMS (2024)

Article Computer Science, Artificial Intelligence

TCM Model for improving track sequence classification in real scenarios with Multi-Feature Fusion and Transformer Block

Ti Xiang, Pin Lv, Liguo Sun, Yipu Yang, Jiuwu Hao

Summary: This paper introduces a Track Classification Model (TCM) based on marine radar, which can effectively recognize and classify shipping tracks. By using a feature extraction network with multi-feature fusion and a dataset production method to address missing labels, the classification accuracy is improved, resulting in successful engineering application in real scenarios.

KNOWLEDGE-BASED SYSTEMS (2024)

Article Computer Science, Artificial Intelligence

Language model as an Annotator: Unsupervised context-aware quality phrase generation

Zhihao Zhang, Yuan Zuo, Chenghua Lin, Junjie Wu

Summary: This paper proposes a novel unsupervised context-aware quality phrase mining framework called LMPhrase, which is built upon large pre-trained language models. The framework mines quality phrases as silver labels using a parameter-free probing technique on the pre-trained language model BERT, and formalizes the phrase tagging task as a sequence generation problem by fine-tuning on the Sequence to-Sequence pre-trained language model BART. The results of extensive experiments show that LMPhrase consistently outperforms existing competitors in two different granularity phrase mining tasks.

KNOWLEDGE-BASED SYSTEMS (2024)

Article Computer Science, Artificial Intelligence

Stochastic Gradient Descent for matrix completion: Hybrid parallelization on shared- and distributed-memory systems

Kemal Buyukkaya, M. Ozan Karsavuran, Cevdet Aykanat

Summary: The study aims to investigate the hybrid parallelization of the Stochastic Gradient Descent (SGD) algorithm for solving the matrix completion problem on a high-performance computing platform. A hybrid parallel decentralized SGD framework with asynchronous inter-process communication and a novel flexible partitioning scheme is proposed to achieve scalability up to hundreds of processors. Experimental results on real-world benchmark datasets show that the proposed algorithm achieves 6x higher throughput on sparse datasets compared to the state-of-the-art, while achieving comparable throughput on relatively dense datasets.

KNOWLEDGE-BASED SYSTEMS (2024)