检索结果-内蒙古大学图书馆

2024 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2024

作者： Li, Li Hu, Jingyang Fu, Shihao Xing, Xin Zhou, Wei School of Big Data and Software Engineering Chongqing University Chongqing400030 China School of Computer Science and Mathematics Anyang University Henan Province 455000 China Chongqing Academy of Metrology and Quality Inspection China

ISBN: (纸本)9781665410205

Existing rumor detection methods have not ade-quately considered which features should be addressed at the macroscopic or micro levels. Furthermore, the fundamental manifestation of news dissemination-public opinion-has received insufficient attention. We propose a macro-micro based public opinion (MMPO) modeling method to address these gaps. This approach enables a better understanding of news dissemination on social media platforms. Firstly, we incorporate post sentiment as a crucial feature. Secondly, we examine how the propagation at the micro-level influences sub-posts. Next, we investigate the temporal variations in public opinion from a macro perspective. Lastly, we integrate the acquired general propagation information with textual data to obtain more distinct representations of news propagation. By leveraging the macro perspective, the proposed model effectively captures the fine-grained characteristics of news propagation and helps smooth out the noise in user comments. The experimental evaluation showcases the superiority of our model in rumor detection compared to existing methods. © 2024 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Aggregation-based dual heterogeneous task allocation in spatial crowdsourcing

引用

Frontiers of computer science 2024年第6期18卷 215-227页

作者： Xiaochuan LIN Kaimin WEI Zhetao LI Jinpeng CHEN Tingrui PEI College of Information Science and Technology&Cyberspace Security Jinan UniversityGuangzhou 510632China National&Local Joint Engineering Research Center of Network Security Detection and Protection Technology Guangzhou 510632China Guangdong Provincial Key Laboratory of Data Security and Privacy Protection Guangzhou 510632China School of Computer Science Beijing University of Posts and TelecommunicationsBeijing 100876China

Spatial crowdsourcing(SC)is a popular data collection paradigm for numerous *** the increment of tasks and workers in SC,heterogeneity becomes an unavoidable difficulty in task *** researches only focus on the single-heterogeneous task ***,a variety of heterogeneous objects coexist in real-world SC *** dramatically expands the space for searching the optimal task allocation solution,affecting the quality and efficiency of data *** this paper,an aggregation-based dual heterogeneous task allocation algorithm is put *** investigates the impact of dual heterogeneous on the task allocation problem and seeks to maximize the quality of task completion and minimize the average travel *** problem is first proved to be ***,a task aggregation method based on locations and requirements is built to reduce task ***,a time-constrained shortest path planning is also developed to shorten the travel distance in a *** that,two evolutionary task allocation schemes are ***,extensive experiments are conducted based on real-world datasets in various *** with baseline algorithms,our proposed schemes enhance the quality of task completion by up to 25% and utilize 34% less average travel distance.

关键词： task allocation aggregation shortest path dual heterogeneous spatial crowdsourcing

来源：评论

学校读者我要写书评

暂无评论

Machine Learning for Subgraph Extraction: Methods, Applications and Challenges 49th

Machine Learning for Subgraph Extraction: Methods, Applicati...

引用

49th International Conference on Very Large data Bases, VLDB 2023

作者： Yow, Kai Siong Liao, Ningyi Luo, Siqiang Cheng, Reynold School of Computer Science and Engineering Nanyang Technological University Singapore Department of Computer Science Guangdong-Hong Kong-Macau Joint Laboratory HKU Musketeers Foundation Institute of Data Science The University of Hong Kong Hong Kong

Subgraphs are obtained by extracting a subset of vertices and a subset of edges from the associated original graphs, and many graph properties are known to be inherited by subgraphs. Subgraphs can be applied in many areas such as social networks, recommender systems, biochemistry and fraud discovery. Researchers from various communities have paid a great deal of attention to investigate numerous subgraph problems, by proposing algorithms that mainly extract important structures of a given graph. There are however some limitations that should be addressed, with regard to the efficiency, effectiveness and scalability of these traditional algorithms. As a consequence, machine learning techniques—one of the most latest trends—have recently been employed in the database community to address various subgraph problems considering that they have been shown to be beneficial in dealing with graphrelated problems. We discuss learning-based approaches for four well known subgraph problems in this tutorial, namely subgraph isomorphism, maximum common subgraph, community detection and community search problems. We give a general description of each proposed model, and analyse its design and performance. To allow further investigations on relevant subgraph problems, we suggest some potential future directions in this area. We believe that this work can be used as one of the primary resources, for researchers who intend to develop learning models in solving problems that are closely related to subgraphs. © 2023, VLDB Endowment. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

PipeMoE: Accelerating Mixture-of-Experts through Adaptive Pipelining 42

PipeMoE: Accelerating Mixture-of-Experts through Adaptive Pi...

引用

42nd IEEE International Conference on computer Communications, INFOCOM 2023

作者： Shi, Shaohuai Pan, Xinglin Chu, Xiaowen Li, Bo Harbin Institute of Technology School of Computer Science and Technology Shenzhen China Hong Kong Baptist University Department of Computer Science Hong Kong Data Science and Analytics Thrust Hong Kong The Hong Kong University of Science and Technology Department of Computer Science and Engineering Hong Kong

ISBN: (纸本)9798350334142

Large models have attracted much attention in the AI area. The sparsely activated mixture-of-experts (MoE) technique pushes the model size to a trillion-level with a sub-linear increase of computations as an MoE layer can be equipped with many separate experts, but only one or two experts need to be trained for each input data. However, the feature of dynamically activating experts of MoE introduces extensive communications in distributed training. In this work, we propose PipeMoE to adaptively pipeline the communications and computations in MoE to maximally hide the communication time. Specifically, we first identify the root reason why a higher pipeline degree does not always achieve better performance in training MoE models. Then we formulate an optimization problem that aims to minimize the training iteration time. To solve this problem, we build performance models for computation and communication tasks in MoE and develop an optimal solution to determine the pipeline degree such that the iteration time is minimal. We conduct extensive experiments with 174 typical MoE layers and two real-world NLP models on a 64-GPU cluster. Experimental results show that our PipeMoE almost always chooses the best pipeline degree and outperforms state-of-the-art MoE training systems by 5%-77% in training time. © 2023 IEEE.

关键词： Pipelines

来源：评论

学校读者我要写书评

暂无评论

Graph Regularized Sparse Non-Negative Matrix Factorization for Clustering

引用

IEEE Transactions on Computational Social Systems 2023年第3期10卷 910-921页

作者： Deng, Ping Li, Tianrui Wang, Hongjun Wang, Dexian Horng, Shi-Jinn Liu, Rui Southwest Jiaotong University National Engineering Laboratory of Integrated Transportation Big Data Application Technology School of Computing and Artificial Intelligence Chengdu611756 China National Taiwan University of Science and Technology Department of Computer Science and Information Engineering Taipei106 Taiwan North Sichuan Medical College School of Preclinical Medicine Department of Computer and Mathematics Nanchong637100 China

The graph regularized nonnegative matrix factorization (GNMF) algorithms have received a lot of attention in the field of machine learning and data mining, as well as the square loss method is commonly used to measure the quality of reconstructed data. However, noise is introduced when data reconstruction is performed;and the square loss method is sensitive to noise, which leads to degradation in the performance of data analysis tasks. To solve this problem, a novel graph regularized sparse NMF (GSNMF) is proposed in this article. To obtain a cleaner data matrix to approximate the high-dimensional matrix, the l1-norm to the low-dimensional matrix is added to achieve the adjustment of data eigenvalues in the matrix and sparsity constraint. In addition, the corresponding inference and alternating iterative update algorithm to solve the optimization problem are given. Then, an extension of GSNMF, namely, graph regularized sparse nonnegative matrix trifactorization (GSNMTF), is proposed, and the detailed inference procedure is also shown. Finally, the experimental results on eight different datasets demonstrate that the proposed model has a good performance. © 2014 IEEE.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

Modeling and Risk Analysis of Cooperative Adaptive Cruise Control Systems Based on Petri Nets and Distributed Edge Intelligence

引用

IEEE Internet of Things Journal 2025年第12期12卷 19995-20006页

作者： Yu, Wangyang Cheng, Yumeng Fang, Xianwen Zhai, Xiaojun Wang, Yinglong Jing, Hongyuan Shaanxi Normal University Chang'an District Key Laboratory of Intelligent Computing and Service Technology for Folk Song Ministry of Culture and Tourism Xi'an710119 China Shaanxi Normal University School of Computer Science Chang'an District Xi'an710119 China Anhui University of Science and Technology Anhui Province Engineering Laboratory for Big Data Analysis and Early Warning Technology of Coal Mine Safety Anhui232001 China University of Essex School of Computer Science and Electronic Engineering Colchester United Kingdom Beijing Union University College of Robotics Beijing100101 China

Fueled by advancements in intelligent transportation systems, the Internet of Vehicles (IoV) seeks to connect smart vehicles, road infrastructure, and users into a unified network, enhancing traffic efficiency and reducing accident risks. Centralized cloud data collection raises concerns about privacy and communication overhead. To address these, Distributed Edge Intelligence (DEI) reduces transmission costs and improves privacy by implementing machine learning at the network edge. In this context, Cooperative Adaptive Cruise Control (CACC) systems, combined with DEI in the IoV framework, enhance transportation system intelligence through real-time data processing and decentralized decision-making. This paper proposes a modeling and analysis method for CACC systems based on Petri nets. The datasets are automatically generated using tools developed by our team, and machine learning methods are utilized to perform risk prediction analysis on the CACC model. From the perspective of Petri nets synchronization, we propose risk mitigation strategies from a design standpoint. The research results show that the proposed method significantly reduces signal accumulation and enhances synchronization in CACC systems. This improvement provides new theoretical support and technical guidance for the design and implementation of CACC systems, ultimately enhancing their safety and reliability. © 2025 IEEE.

关键词： Adaptive cruise control

来源：评论

学校读者我要写书评

暂无评论

Heart Disease Diagnosis Using the Brute Force Algorithm and Machine Learning Techniques

引用

computers, Materials & Continua 2022年第8期72卷 3195-3211页

作者： Junaid Rashid Samina Kanwal Jungeun Kim Muhammad Wasif Nisar Usman Naseem Amir Hussain Department of Computer Science and Engineering Kongju National UniversityCheonan31080Korea Department of Computer Science COMSATS University IslamabadWah Campus47040Pakistan School of Computer Science University of SydneySydneyNSW 2006Australia Centre of AI and Data Science Edinburgh Napier UniversityEdinburghEH114DYUK

Heart disease is one of the leading causes of death in the world *** of heart disease is a prominent topic in the clinical data *** increase patient survival rates,early diagnosis of heart disease is an important field of research in the medical *** are many studies on the prediction of heart disease,but limited work is done on the selection of *** selection of features is one of the best techniques for the diagnosis of heart *** this research paper,we find optimal features using the brute-force algorithm,and machine learning techniques are used to improve the accuracy of heart disease *** performance evaluation,accuracy,sensitivity,and specificity are used with split and cross-validation *** results of the proposed technique are evaluated in three different heart disease datasets with a different number of records,and the proposed technique is found to have superior *** selection of optimized features generated by the brute force algorithm is used as input to machine learning algorithms such as Support Vector Machine(SVM),Random Forest(RF),K Nearest Neighbor(KNN),and Naive Bayes(NB).The proposed technique achieved 97%accuracy with Naive Bayes through split validation and 95%accuracy with Random Forest through *** Bayes and Random Forest are found to outperform other classification approaches when accurately *** results of the proposed technique are compared with the results of the existing study,and the results of the proposed technique are found to be better than other ***,our proposed approach plays an important role in the selection of important features and the automatic detection of heart disease.

关键词： Heart disease brute force machine learning feature selection

来源：评论

学校读者我要写书评

暂无评论

MCITEBENCH: A Benchmark for Multimodal Citation Text Generation in MLLMs

arXiv

引用

arXiv 2025年

作者： Hu, Caiyu Zhang, Yikai Zhu, Tinghui Ye, Yiwei Xiao, Yanghua Shanghai Key Laboratory of Data Science School of Computer Science Fudan University China School of Computer Engineering and Science Shanghai University China

Multimodal Large Language Models (MLLMs) have advanced in integrating diverse modalities but frequently suffer from hallucination. A promising solution to mitigate this issue is to generate text with citations, providing a transparent chain for verification. However, existing work primarily focuses on generating citations for text-only content, overlooking the challenges and opportunities of multimodal contexts. To address this gap, we introduce MCITEBENCH, the first benchmark designed to evaluate and analyze the multimodal citation text generation ability of MLLMs. Our benchmark comprises data derived from academic papers and review-rebuttal interactions, featuring diverse information sources and multimodal content. We comprehensively evaluate models from multiple dimensions, including citation quality, source reliability, and answer accuracy. Through extensive experiments, we observe that MLLMs struggle with multimodal citation text generation. We also conduct deep analyses of models’ performance, revealing that the bottleneck lies in attributing the correct sources rather than understanding the multimodal content. Copyright © 2025, The Authors. All rights reserved.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

A Differential Privacy Protection Protocol Based on Location Entropy

引用

Tsinghua science and Technology 2023年第3期28卷 452-463页

作者： Ping Guo Baopeng Ye Yuling Chen Tao Li Yixian Yang Xiaobin Qian Xiaomei Yu State Key Laboratory of Public Big Data School of Computer Science and TechnologyGuizhou UniversityGuiyang 550025China Information Technology Innovation Service Center of Guizhou Province Guiyang 550025China School of Cyberspace Security Beijing University of Posts and TelecommnuicationsBeijing 100000China Guizhou CoVision Science&Technology Co. Ltd.Guiyang 550025China School of Information Science and Engineering Shandong Normal UniversityJinan 250000China

A Location-Based Service(LBS)refers to geolocation-based services that bring both convenience and *** an increase in the scale and value of data,most existing location privacy protection protocols cannot balance privacy and *** solve the revealing problems in LBS,we propose a differential privacy protection protocol based on location ***,we design an algorithm of the best-assisted user selection for constructing anonymity ***,we employ smart contracts to evaluate the credibility of participants,which ensures the honesty of ***,we provide a comprehensive experiment;the theoretical analysis and experiments show that the proposed protocol effectively resists background knowledge ***,our protocol improves data ***,it realizes user-controllable privacy protection,which improves privacy protection and strengthens security.

关键词： Location-Based Services(LBS) smart contract location entropy differential privacy privacy protection

来源：评论

学校读者我要写书评

暂无评论

Regularized Multi-LLMs Collaboration for Enhanced Score-Based Causal Discovery 25th

Regularized Multi-LLMs Collaboration for Enhanced Score-Bas...

引用

25th International Conference on Web Information Systems engineering, WISE 2024

作者： Li, Xiaoxuan Liu, Yao Wang, Ruoyu Yao, Lina University of New South Wales Sydney Australia School of Computer Science and Engineering Northeastern University Shenyang110169 China School of Computing Macquarie University Sydney Australia CSIRO’s Data61 Sydney Australia

ISBN: (纸本)9789819605729

As the significance of understanding the cause-and-effect relationships among variables increases in the development of modern systems and algorithms, learning causality from observational data has become a preferred and efficient approach over conducting randomized control trials. However, purely observational data could be insufficient to reconstruct the true causal graph. Consequently, many researchers tried to utilise some form of prior knowledge to improve causal discovery process. In this context, the impressive capabilities of large language models (LLMs) have emerged as a promising alternative to the costly acquisition of prior expert knowledge. In this work, we further explore the potential of using LLMs to enhance causal discovery approaches, particularly focusing on score-based methods, and we propose a general framework to utilise the capacity of not only one but multiple LLMs to augment the discovery process. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：