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

Plausible Heterogeneous Graph k-Anonymization for Social Networks

Tsinghua science and Technology 2022年第6期27卷 912-924页

作者： Kaiyang Li Ling Tian Xu Zheng Bei Hui School of Computer Science and Engineering University of Electronic Science and Technology of ChinaChengdu 611731China School of Information and Software Engineering University of Electronic Science and Technology of ChinaChengdu 610054China Trusted Cloud Computing and Big Data Key Laboratory of Sichuan Province Chengdu 610000China

The inefficient utilization of ubiquitous graph data with combinatorial structures necessitates graph embedding methods,aiming at learning a continuous vector space for the graph which is amenable to be adopted in traditional machine learning algorithms in favor of vector *** embedding methods build an important bridge between social network analysis and data analytics as social networks naturally generate an unprecedented volume of graph data *** social network data not only bring benefit for public health,disaster response,commercial promotion,and many other applications,but also give birth to threats that jeopardize each individual’s privacy and ***,most existing works in publishing social graph embedding data only focus on preserving social graph structure with less attention paid to the privacy issues inherited from social *** be specific,attackers can infer the presence of a sensitive relationship between two individuals by training a predictive model with the exposed social network *** this paper,we propose a novel link-privacy preserved graph embedding framework using adversarial learning,which can reduce adversary’s prediction accuracy on sensitive links while persevering sufficient non-sensitive information such as graph topology and node attributes in graph *** experiments are conducted to evaluate the proposed framework using ground truth social network datasets.

关键词： social network graph embedding privacy preservation adversarial learning

来源：评论

学校读者我要写书评

暂无评论

Text-Image Scene Graph Fusion for Multimodal Named Entity Recognition

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第6期5卷 2828-2839页

作者： Cheng, Jian Long, Kaifang Zhang, Shuang Zhang, Tian Ma, Lianbo Cheng, Shi Guo, Yinan State Key Laboratory for Intelligent Coal Mining and Strata Control Research Institute of Mine Big Data Chinese Institute of Coal Science Beijing100013 China Northeastern University College of Software Shenyang110819 China Shaanxi Normal University College of Computer Science Xi'an710062 China China University of Mining and Technology Xuzhou221116 China

With the popularity and widespread use of social media platforms, such as Twitter and Facebook, massive amounts of text and image information posted by a variety of users have flooded these social media platforms. Thus, multimodal named entity recognition (MNER) has become a research hotspot for the task of extracting named entities from multimodal data. Empirically, the visual clues unrelated to text data may introduce uncertain or even negative impacts on the named entity recognition. The considerations of the relevance of multimodal data have been ignored in the previous studies. In this article, to effectively measure the relationship between text data and visual cues for improving the accuracy of named entities, we propose a text-image scene graph fusion (TISGF) approach with a text-image similarity assessment module (TISA) and a text-image fusion module (TIF) for MNER. Specifically, we first construct two (visual and textual) scene graphs to exploit the joint features of objects and relations in text and image and encode the two scene graphs separately using a specific encoder pair. In this way, we can obtain both object-level and relationship-level cross-modal features. Subsequently, TISA is used to compute the similarity of the image and text data and to determine the proportion of visual information that will be retained for fusion. Finally, we use TIF to achieve a unified multimodal representation of each word and predict the entity type using conditional random fields. Extensive experiment results on two public datasets demonstrate the effectiveness and competitiveness of our proposed method for the MNER task. © 2020 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

LaCo: Large Language Model Pruning via Layer Collapse

LaCo: Large Language Model Pruning via Layer Collapse

引用

2024 Conference on Empirical Methods in Natural Language Processing, EMNLP 2024

作者： Yang, Yifei Cao, Zouying Zhao, Hai Department of Computer Science and Engineering Shanghai Jiao Tong University China Key Laboratory of Shanghai Education Commission for Intelligent Interaction and Cognitive Engineering Shanghai Jiao Tong University China Shanghai Key Laboratory of Trusted Data Circulation and Governance in Web3 China

ISBN: (纸本)9798891761681

Large language models (LLMs) based on transformer are witnessing a notable trend of size expansion, which brings considerable costs to both model training and inference. However, existing methods such as model quantization, knowledge distillation, and model pruning are constrained by various issues, including hardware support limitations, the need for extensive training, and alterations to the model internal structure. In this paper, we propose a concise layer-wise structured pruner called Layer Collapse (LaCo), in which rear model layers collapse into a prior layer, enabling a rapid reduction in model size while preserving the model structure. Comprehensive experiments show that our method maintains an average task performance of over 80% at pruning ratios of 25-30%, significantly outperforming existing state-of-the-art structured pruning methods. We also conduct post-training experiments to confirm that the LaCo effectively inherits the parameters of the original model. Additionally, we perform ablation studies on various settings of LaCo. Finally, we discuss our motivation from the perspective of layer-wise similarity and evaluate the performance of the pruned LLMs across various pruning ratios. © 2024 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

An Extractive Automatic Summarization Method for Chinese Long Text 9th

An Extractive Automatic Summarization Method for Chinese Lon...

引用

19th International Conference on Advanced data Mining and Applications, ADMA 2023

作者： Zhu, Jizhao Duan, Wenyu Yu, Naitong Pan, Xinlong Fan, Chunlong Shenyang Aerospace University Shenyang China Key Laboratory of Network Data Science and Technology Institute of Computing Technology Beijing China Naval Aviation University Yantai China

ISBN: (纸本)9783031466632

The extractive automatic summarization method is capable of quickly and efficiently generating summaries through the steps of scoring, extracting and eliminating redundant sentences. Currently, most extractive methods utilize deep learning technology to treat automatic summarization as a binary classification task. However, the effectiveness of automatic summarization for Chinese long text is limited by the maximum input length of the model, and it requires a large amount of training data. This paper proposes an unsupervised extractive automatic summarization method which solves the long text encoding problem by incorporating contextual semantics into sentence-level encoding. Firstly, we obtain the semantic representation of sentences by using the RoBERTa model. Secondly, we propose an improved k-Means algorithm to cluster sentence representations. By defining sparse and dense clusters, we improve the accuracy of summary sentence selection while preserving maximum semantic information from the original text. Experimental results on the CAIL2020 dataset show that our method outperforms baselines by 6.64/7.68/7.14% respectively on ROUGE-1/2/L. Moreover, we further enhance the automatic summarization results by 4.5/5.36/3.24% by adding domain rules tailored to the dataset’s characteristics. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： K-means clustering

来源：评论

学校读者我要写书评

暂无评论

Prediction of remaining useful life of lithium batteries based on Decayable-LSTM

Prediction of remaining useful life of lithium batteries bas...

引用

Chinese Control and Decision Conference, CCDC

作者： Penghua Li Dailin Gao Key Laboratory of Intelligent Computing for Big Data College of Automation Chongqing University of Posts and Telecommunications Chongqing China

ISBN: (数字)9798350387780

ISBN: (纸本)9798350387797

data-driven techniques have been extensively employed in practical applications involving lithium-ion batteries. However, the accuracy of these methods heavily relies on the quality and quantity of the collected data. The presence of missing values, resulting from external factors, poses a challenge in effectively leveraging the collected data. To address this issue, this paper proposes a novel approach that utilizes long short-term memory (LSTM) to extract valuable features from randomly missing data. Additionally, an interactive network organized in a tree structure is employed for predicting the remaining useful life (RUL). Experimental results on the NASA dataset demonstrate the superiority of our method, achieving a lower root mean square error(RMSE) of 0.01265 ± 0.001 for RUL, surpassing other data-driven methods.

关键词： Lithium-ion batteries Computational modeling NASA Predictive models Feature extraction Attenuation Lithium batteries

来源：评论

学校读者我要写书评

暂无评论

A survey on deep learning for polyp segmentation: techniques, challenges and future trends

引用

Visual Intelligence 2025年第1期3卷 1-20页

作者： Mei, Jiaxin Zhou, Tao Huang, Kaiwen Zhang, Yizhe Zhou, Yi Wu, Ye Fu, Huazhu PCA Lab Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education Nanjing China School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing China School of Computer Science and Engineering Southeast University Nanjing China Institute of High Performance Computing A*STAR Singapore Singapore

Early detection and assessment of polyps play a crucial role in the prevention and treatment of colorectal cancer (CRC). Polyp segmentation provides an effective solution to assist clinicians in accurately locating and segmenting polyp regions. In the past, people often relied on manually extracted lower-level features such as color, texture, and shape, which often had problems capturing global context and lacked robustness to complex scenarios. With the advent of deep learning, more and more medical image segmentation algorithms based on deep learning networks have emerged, making significant progress in the field. This paper provides a comprehensive review of polyp segmentation algorithms. We first review some traditional algorithms based on manually extracted features and deep segmentation algorithms, and then describe benchmark datasets related to the topic. Specifically, we carry out a comprehensive evaluation of recent deep learning models and results based on polyp size, taking into account the focus of research topics and differences in network structures. Finally, we discuss the challenges of polyp segmentation and future trends in the field. © The Author(s) 2025.

关键词： Comprehensive evaluation Deep learning Medical imaging Polyp segmentation

来源：评论

学校读者我要写书评

暂无评论

Privacy Protection Multi-copy Provable data Possession Supporting data Reliability 5th

Privacy Protection Multi-copy Provable Data Possession Suppo...

引用

5th International Conference on Blockchain and Trustworthy Systems, BlockSys 2023

作者： Zhang, Feng Wen, Bin Yan, Yifei Zeng, Zhaowu Zhou, Wei School of Information Science and Technology Hainan Normal University Haikou571158 China Cloud Computing and Big Data Research Center Hainan Normal University Haikou571158 China Key Laboratory of Data Science and Smart Education Ministry of Education Hainan Normal University Haikou571158 China

ISBN: (纸本)9789819981007

With the development of technology, a massive amount of data continues to emerge, and there is still a strong demand for data storage. Outsourcing data to cloud service providers has become a common practice. Although cloud storage offers the advantage of location-independent data access and reduces burdens such as hardware and software maintenance, this service still faces some challenges in terms of privacy and data reliability. To address this issue, we present Privacy-preserving Multi-copy Provable data Possession supporting data Reliability (PMPDP-R). Our proposal ensures the integrity, reliability, and freshness of data by designing Timestamp-based Double-layer Merkle Hash Tree (TD-MHT), a novel dynamic structure for multicopy storage. Furthermore, our approach uses random masking techniques to develop unique replica blocks and safeguard privacy. We’ve also ensured data reliability by enabling PMPDP-R to locate damaged data blocks to aid recovery. The experimental analysis proves that our scheme is both practical and effective. © 2024, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Cloud storage

来源：评论

学校读者我要写书评

暂无评论

Logical Relation Modeling and Mining in Hyperbolic Space for Recommendation 40

Logical Relation Modeling and Mining in Hyperbolic Space for...

引用

40th IEEE International Conference on data Engineering, ICDE 2024

作者： Tan, Yanchao Lv, Hang Zhou, Zihao Guo, Wenzhong Xiong, Bo Liu, Weiming Chen, Chaochao Wang, Shiping Yang, Carl College of Computer and Data Science Fuzhou University Fuzhou China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China Institute for Artificial Intelligence University of Stuttgart Stuttgart Germany College of Computer Science Zhejiang University Hangzhou China Emory University Department of Computer Science Atlanta United States

ISBN: (纸本)9798350317152

The sparse interactions between users and items have aggravated the difficulty of their representations in recommender systems. Existing methods leverage tags to alleviate the sparsity problem but ignore prevalent logical relations among items and tags (e.g., membership, hierarchy, and exclusion), which can be leveraged to enhance the accuracy of modeling user preferences and conducting recommendations. To this end, we propose to extract logical relations among item tags from existing tag taxonomies and exploit the individual strengths of the Poincaré and the Lorentz models in hyperbolic space for logical relation modeling towards enhanced recommendations. Moreover, we find that the logical relations directly extracted from existing tag taxonomies can be inaccurate and coarse. Therefore, we further devise innovative consistency-based and granularity-based weighting mechanisms based on user behavior patterns for data-driven logical relation mining that can be jointly optimized along with recommendations in an end-to-end fashion. Extensive experiments on four real-world benchmark datasets show drastic performance gains brought by our proposed framework, which constantly achieves an average of 8.25% improvement over state-of-the-art competitors regarding both Recall and NDCG metrics. Insightful case studies further demonstrate that our automatically refined logical relations are highly accurate and interpretable. © 2024 IEEE.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

How to Train Your Neural Network for Molecular Structure Generation from Mass Spectra?

How to Train Your Neural Network for Molecular Structure Gen...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Zhao, Kai Liu, Yanmin Dian, Longyang Sun, Shiwei Cui, Xuefeng Shandong University School of Computer Science and Technology Qingdao China Shandong University State Key Laboratory of Microbial Technology Qingdao China Chinese Academy of Sciences Key Lab of Intelligent Information Processing Institute of Computing Technology Beijing China

ISBN: (纸本)9798350386226

Mass spectrometry serves as a pivotal tool for the analysis of small molecules through an examination of their mass-to-charge ratios. Recent advancements in deep learning have markedly enhanced the analysis of mass spectrometric data, facilitating the prediction of novel small molecule structures without the necessity of extensive databases. Nonetheless, the paucity of annotated datasets impedes the efficacious training of molecular generation models predicated on MS2 spectra. To mitigate this limitation, we introduce ctMSNovelist, an avant-garde method that amalgamates pre-training, fine-tuning, and co-training techniques to construct a more precise model for the generation of molecular structures from tandem mass spectrometry data. This novel approach augments both the training regimen and the predictive accuracy of the MSNovelist model, thereby surmounting the obstacle of limited data. The methodology commences with the pretraining of a Variational Autoencoder (VAE) to generate molecular fingerprints derived from SMILES strings. Subsequently, it undergoes fine-tuning to emulate noisy fingerprints originating from mass spectrometry (MS) data. Concurrently, MSNovelist is co-trained utilizing these simulated fingerprints, inclusive of the highly noisy variants produced in the early stages of VAE training. The incorporation of a substantial volume of noisy data serves to enhance model accuracy and avert overfitting. We evaluated ctMSNovelist using the GNPS dataset and attained a SMILES prediction accuracy of 48.8%, representing a 4.1% enhancement over MSNovelist. It is pertinent to note that the sole distinction between ctMSNovelist and MSNovelist in this experiment was the training process. The code and models are publicly available at https://***/xfcui/ctMSNovelist. © 2024 IEEE.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

A double-layer crowd evacuation simulation method based on deep reinforcement learning

A double-layer crowd evacuation simulation method based on d...

引用

作者： Zhang, Yong Yang, Bo Zhu, Jianlin College of Computer Science South-Central Minzu University Wuhan China Key Laboratory of Cyber-Physical Fusion and Intelligent Computing South-Central Minzu University State Ethnic Affairs Commission Wuhan China

Existing crowd evacuation simulation methods commonly face challenges of low efficiency in path planning and insufficient realism in pedestrian movement during the evacuation process. In this study, we propose a novel crowd evacuation path planning approach based on the learning curve–deep deterministic policy gradient (LC-DDPG) algorithm. The algorithm incorporates dynamic experience pool and a priority experience sampling strategy, enhancing convergence speed and achieving higher average rewards, thus efficiently enabling global path planning. Building upon this foundation, we introduce a double-layer method for crowd evacuation using deep reinforcement learning. Specifically, within each group, individuals are categorized into leaders and followers. At the top layer, we employ the LC-DDPG algorithm to perform global path planning for the leaders. Simultaneously, at the bottom layer, an enhanced social force model guides the followers to avoid obstacles and follow the leaders during evacuation. We implemented a crowd evacuation simulation platform. Experimental results show that our proposed method has high path planning efficiency and can generate more realistic pedestrian trajectories in different scenarios and crowd sizes. © 2024 John Wiley & Sons Ltd.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：