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

28th International Conference on database Systems for Advanced Applications, DASFAA 2023

作者： Jiang, Xuhui Shen, Yinghan Wang, Yuanzhuo Shen, Huawei Xu, Chengjin Ma, Shengjie Data Intelligent System Research Center Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Computer Science and Technology UCAS Gloucester United Kingdom Big Data Academy Zhongke Zhengzhou China International Digital Economy Academy Shenzhen China Gaoling School of Artificial Intelligence Renmin University of China Beijing China

ISBN: (纸本)9783031306747

Social relation reasoning in heterogeneous social networks (HSNs) should not only infer whether people are connected, but also why they know each other and what their relationship is. This task is challenging because the heterogeneous social network is non-trivial to leverage and the collected data is always noisy and incomplete, which leads that the existing rule-based and representation methods cannot efficiently and accurately reason social relations. To reason social relations in noisy and incomplete HSNs, we shift from simply inferring meta-path based social relations by rule-based methods to reasoning by social relation learning. Then, we present an inductive model named Heterogeneous Graph Variational AutoEncoders (HGVAE) towards robust social relation learning on noisy and incomplete HSN data. In HGVAE, the well-designed heterogeneous graph encoder, multi-signal decoder, and variational inference mechanism bring prominent robustness and significant performance improvement. Extensive experiments are conducted to compare our methods against a set of the most representative baseline methods. The efficiency analysis, robust analysis and ablation studies confirm the value of our proposed approach for modelling meta-path based social relations buried in various HSNs. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

Research on Technologies in data Fabric

Research on Technologies in Data Fabric

引用

IEEE International Conference on Trust, Security and Privacy in computing and Communications (TrustCom)

作者： Qingyuan Hu Zheng Yin Tao Tao Jibin Wang Zhuo Chen Bohuan Ai Yu Liu Chongzhou Liu China Mobile Information Technology Center Beijing China Cloud Computing and Big Data Research Institute China Academy of Information and Communications Technology Beijing China

ISBN: (数字)9798350381993

ISBN: (纸本)9798350382006

With the continuous advancement of technologies like big data, artificial intelligence, and cloud computing, enterprises are increasingly encountering challenges related to the heterogeneity of data from various sources, difficulties in querying data assets, and understanding business insights. To address these issues, data fabric emerges as a solution that leverages distributed data management. By harnessing metadata and facilitating its activation, data fabric enables organizations to efficiently and accurately manage and locate data assets. However, it is important to note that this concept is still under development and faces obstacles such as establishing connections with additional data sources and unifying semantics. Nonetheless, overall, the concept of data fabric exhibits remarkable potential in assisting enterprises in transitioning towards becoming data-driven organizations.

关键词： Industries cloud computing Technological innovation Soft sensors Standards organizations Distributed databases Collaboration

来源：评论

学校读者我要写书评

暂无评论

Hyperbolic Geometric Latent Diffusion Model for Graph Generation 41

Hyperbolic Geometric Latent Diffusion Model for Graph Genera...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Fu, Xingcheng Gao, Yisen Wei, Yuecen Sun, Qingyun Peng, Hao Li, Jianxin Li, Xianxian Key Lab of Education Blockchain and Intelligent Technology Ministry of Education Guangxi Normal University Guilin China Institute of Artificial Intelligence Beihang University Beijing China School of Software Beihang University Beijing China Beijing Advanced Innovation Center for Big Data and Brain Computing School of Computer Science and Engineering Beihang University Beijing China

Diffusion models have made significant contributions to computer vision, sparking a growing interest in the community recently regarding the application of them to graph generation. Existing discrete graph diffusion models exhibit heightened computational complexity and diminished training efficiency. A preferable and natural way is to directly diffuse the graph within the latent space. However, due to the non-Euclidean structure of graphs is not isotropic in the latent space, the existing latent diffusion models effectively make it difficult to capture and preserve the topological information of graphs. To address the above challenges, we propose a novel geometrically latent diffusion framework HypDiff. Specifically, we first establish a geometrically latent space with interpretability measures based on hyperbolic geometry, to define anisotropic latent diffusion processes for graphs. Then, we propose a geometrically latent diffusion process that is constrained by both radial and angular geometric properties, thereby ensuring the preservation of the original topological properties in the generative graphs. Extensive experimental results demonstrate the superior effectiveness of HypDiff for graph generation with various topologies. Copyright 2024 by the author(s)

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

A Multimodal Knowledge Representation Method for Fake News Detection

A Multimodal Knowledge Representation Method for Fake News D...

引用

Computer, Control and Robotics (ICCCR), International Conference on

作者： Fanhao Zeng Jiaxin Yao Yijie Xu Yanhua Liu Fujian Key Laboratory of Network Computing and Intelligent Information Processing College of Computer and Data Science Fuzhou University Engineering Research Center of Big Data Intelligence Ministry of Education (Fuzhou University) Fuzhou China

ISBN: (数字)9798350373141

ISBN: (纸本)9798350373158

To address the key challenge encountered in fake news detection, i.e., multimodal data is difficult to be effectively semantically represented due to its intrinsic heterogeneity, this paper proposes a multimodal knowledge representation method for fake news detection. First, visual feature extraction is performed for fake news image data, the relevant images are sliced into multiple blocks, and then visual modal features are obtained by linear projection layer mapping. This simplifies the feature extraction process and reduces the computational cost, which helps to improve the fake news recognition performance. Second, to meet the actual fake news detection needs, a long text representation method based on topic words is investigated for the text data in fake news. Finally, the multimodal representation of the same fake news data is optimized by establishing a connection between two different modalities, visual and text, and inputting it into a BiLSTM-Attention based network to achieve the fusion of multimodal features. The experiment selects the same fake news data of EANN model and uses four classical classification methods to verify the effect of knowledge representation and compare it with the fusion model ViLT which is not optimized for long text. The experiment proves that the accuracy rate of fake news detection using the multimodal representation proposed in this paper is improved by 7.4% compared to the EANN model, and by 9.3% compared to the ViLT representation.

关键词： Digital control Visualization Accuracy Knowledge representation Machine learning Feature extraction data models

来源：评论

学校读者我要写书评

暂无评论

Using Rough Sets to Improve the High-dimensional data Anomaly Detection Method Based on Extended Isolation Forest

Using Rough Sets to Improve the High-dimensional Data Anomal...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Hanlin Liu Jiantao Zhou Hua Li College of Computer Science Inner Mongolia University Hohhot China Inner Mongolia Key Laboratory of Discipline Inspection and Supervision Big Data Inner Mongolia Engineering Laboratory for Big Data Analysis Technology Ministry of Education Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Inner Mongolia Key Laboratory of Social Computing and Data Processing National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian Engineering Research Center of Ecological Big Data Hohhot China

Anomaly detection refers to the identification of data objects that deviate from the general data distribution. One of the important challenges in anomaly detection is handling high-dimensional data, especially when it contains a large number of redundant attributes. Although traditional Isolation Forest (iForest) and Extended Isolation Forest (EIF) have performed well in anomaly detection, the detection accuracy is still extremely influenced by redundant attributes. In this paper, we propose a two-tier architecture named RS-EIF, to alleviate the negative impact of redundant attributes. Specifically, the RS-EIF combines the rough set theory and EIF algorithm and provides an effective basis for the EIF-based anomaly detection method by removing redundant attributes with rough set theory. Experimental results show that the RS-EIF algorithm performs better than the iForest and EIF algorithms in terms of anomaly detection rate, and the results of the combination of rough set theory and EIF are more prominent compared to the other combination methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Distributed Framework for Large-scale Protein-protein Interaction data Analysis and Prediction Using MapReduce

引用

IEEE/CAA Journal of Automatica Sinica 2022年第1期9卷 160-172页

作者： Lun Hu Shicheng Yang Xin Luo Huaqiang Yuan Khaled Sedraoui MengChu Zhou School of Computer Science and Technology Dongguan University of TechnologyDongguan 523808China School of Computer Science and Technology Wuhan University of TechnologyWuhan 430070China Chongqing Engineering Research Center of Big Data Application for Smart Cities and Chongqing Key Laboratory of Big Data and Intelligent ComputingChongqing Institute of Green and Intelligent TechnologyChinese Academy of SciencesChongqing 400714China Xinjiang Technical Institute of Physics and Chemistry Chinese Academy of SciencesUrumqi 830000China Center of Research Excellence in Renewable Energy and Power Systems and the Department of Electrical and Computer EngineeringFaculty of EngineeringKing Abdulaziz UniversityJeddah 21589Saudi Arabia Department of Electrical and Computer Engineering New Jersey Institute of TechnologyNewarkNJ 07102 USA

Protein-protein interactions are of great significance for human to understand the functional mechanisms of *** the rapid development of high-throughput genomic technologies,massive protein-protein interaction(PPI)data have been generated,making it very difficult to analyze them *** address this problem,this paper presents a distributed framework by reimplementing one of state-of-the-art algorithms,i.e.,CoFex,using *** do so,an in-depth analysis of its limitations is conducted from the perspectives of efficiency and memory consumption when applying it for large-scale PPI data analysis and *** solutions are then devised to overcome these *** particular,we adopt a novel tree-based data structure to reduce the heavy memory consumption caused by the huge sequence information of *** that,its procedure is modified by following the MapReduce framework to take the prediction task distributively.A series of extensive experiments have been conducted to evaluate the performance of our framework in terms of both efficiency and *** results well demonstrate that the proposed framework can considerably improve its computational efficiency by more than two orders of magnitude while retaining the same high accuracy.

关键词： Distributed computing large-scale prediction machine learning MapReduce protein-protein interaction(PPI)

来源：评论

学校读者我要写书评

暂无评论

A Graph Sequence Generator and Multi-head Self-attention Mechanism based Knowledge Graph Reasoning Architecture

A Graph Sequence Generator and Multi-head Self-attention Mec...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Yuejia Wu Jian-Tao Zhou College of Computer Science Inner Mongolia University National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian Engineering Research Center of Ecological Big Data Ministry of Education Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Inner Mongolia Key Laboratory of Social Computing and Data Processing Inner Mongolia Key Laboratory of Discipline Inspection and Supervision Big Data Inner Mongolia Engineering Laboratory for Big Data Analysis Technology Hohhot China

Knowledge Graph (KG) is an essential research direction that involves storing and managing knowledge data, but its incompleteness and sparsity hinder its development in various applications. Knowledge Graph Reasoning (KGR) is an effective method to solve this limitation via reasoning missing knowledge based on existing knowledge. The graph Convolution Network (GCN) based method is one of the state-of-the-art approaches to this work. However, there are still some problems, such as the insufficient ability to perceive graph structure and the poor effect of learning data features which may limit the reasoning accuracy. This paper proposes a KGR architecture based on a graph sequence generator and multi-head self-attention mechanism, named GaM-KGR, to improve the above problems and enhance prediction accuracy. Specifically, the GaM-KGR first introduces the graph generation model into the field of KGR for graph representation learning to obtain the hidden features in the data so that enhancing the reasoning effect and then embeds the generated graph sequence into the multi-head self-attention mechanism for subsequent processing to improve the graph structure perception ability of the proposed architecture, so that it can process the graph structure data more appropriately. Extensive experimental results show that the GaM-KGR architecture can achieve the state-of-the-art prediction results of current GCN-based models.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Visitors Vis: Interactive Mining of Suspected Medical Insurance Fraud Groups 18th

Visitors Vis: Interactive Mining of Suspected Medical Insura...

引用

18th CCF Conference on Computer Supported Cooperative Work and Social computing, ChineseCSCW 2023

作者： Dong, Rixin Liu, Hanlin Guo, Xu Zhou, Jiantao College of Computer Science Inner Mongolia University Hohhot China National and Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolia Hohhot China Engineering Research Center of Ecological Big Data Ministry of Education Hohhot China Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Hohhot China Inner Mongolia Key Laboratory of Social Computing and Data Processing Hohhot China Inner Mongolia Key Laboratory of Discipline Inspection and Supervision Big Data Hohhot China Inner Mongolia Engineering Laboratory for Big Data Analysis Technology Hohhot China

ISBN: (纸本)9789819996360

As medical insurance continues to grow in size, the losses caused by medical insurance fraud cannot be underestimated. Current data mining and predictive techniques have been applied to analyze and explore the health insurance fraud population. However, previous studies only provide summary results and do not show the details of comparative analysis during the visit, resulting in the inability of auditors to quickly identify anomalous behavior. In this paper, we propose a visual analytics system for interactive medical insurance fraud detection to support the exploration and interpretation of different access processes. We propose a weighted MinDL to improve the accuracy of visit pattern classification in the time-series modeling process, and design a data analysis model and visual analysis view based on medical insurance fraud characteristics to reveal and explore the characteristics of medical insurance fraud groups. We collaborate with related organizations to design and implement an interactive visualization for medical insurance fraud group detection using real Medicare data and expert interviews The system is effective and practical in detecting and analyzing medical insurance fraud syndicates. © 2024, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Health insurance

来源：评论

学校读者我要写书评

暂无评论

An Uncovered Neurons Information-Based Fuzzing Method for DNN

An Uncovered Neurons Information-Based Fuzzing Method for DN...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Kecheng Tang Jian-Tao Zhou Xu Guo College of Computer Science Inner Mongolia University Hohhot China National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian Hohhot China Engineering Research Center of Ecological Big Data Ministry of Education Hohhot China Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Hohhot China Inner Mongolia Key Laboratory of Social Computing and Data Processing Hohhot China Inner Mongolia Key Laboratory of Discipline Inspection and Supervision Big Data Hohhot China Inner Mongolia Engineering Laboratory for Big Data Analysis Technology Hohhot China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

Fuzzing is increasingly being utilized as a method to test the reliability of Deep Learning (DL) systems. In order to detect more errors in DL systems, exploring the internal logic of more DNNs has become the main objective of fuzzing. Despite advancements in the seed selection aspect of fuzzing, considerable opportunities still exist for improving testing efficiency. Current research has issues with the repeated consideration of neurons in the model that will be covered in the future by other seeds, leading to redundant seeds and lower testing efficiency. Additionally, there is a lack of a method to measure the potential of seeds to increase coverage, making it difficult to select the most worthy seeds for mutation in each iteration. We propose an uncovered neurons information based (UNIB) fuzzing method for DNN. UNIB uses clustering methods to organize the seed queue based on initial seed data, aiming to enhance the coverage rate improved in each iteration. It also integrates coverage information from the testing phase to identify the seeds with the greatest potential. The experimental results show that UNIB achieved a higher NC than the second-best method by 1.1% and 3% in LetNet-4 and LetNet-5, respectively. UNIB consistently required the fewest number of iterations to reach the same NC as other methods. For both LetNet-4 and LetNet-5, the adversarial test case sets generated by UNIB exhibited the highest diversity.

关键词： Deep learning Federated learning Current measurement Neurons Neural networks Fuzzing Software

来源：评论

学校读者我要写书评

暂无评论

GBFRS: Robust Fuzzy Rough Sets via Granular-ball computing

arXiv

引用

arXiv 2025年

作者： Xia, Shuyin Lian, Xiaoyu Sang, Binbin Wang, Guoyin Gao, Xinbo Chongqing Key Laboratory of Computational Intelligence Key Laboratory of Big Data Intelligent Computing Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education Chongqing University of Posts and Telecommunications Chongqing400065 China College of Computer and Information Science the National Center for Applied Mathematics in Chongqing Chongqing Normal University Chongqing401331 China

Fuzzy rough set theory is effective for processing datasets with complex attributes, supported by a solid mathematical foundation and closely linked to kernel methods in machine learning. Attribute reduction algorithms and classifiers based on fuzzy rough set theory exhibit promising performance in the analysis of high-dimensional multivariate complex data. However, most existing models operate at the finest granularity, rendering them inefficient and sensitive to noise, especially for high-dimensional big data. Thus, enhancing the robustness of fuzzy rough set models is crucial for effective feature selection. Muiti-garanularty granular-ball computing, a recent development, uses granular-balls of different sizes to adaptively represent and cover the sample space, performing learning based on these granular-balls. This paper proposes integrating multi-granularity granular-ball computing into fuzzy rough set theory, using granular-balls to replace sample points. The coarse-grained characteristics of granular-balls make the model more robust. Additionally, we propose a new method for generating granular-balls, scalable to the entire supervised method based on granular-ball computing. A forward search algorithm is used to select feature sequences by defining the correlation between features and categories through dependence functions. Experiments demonstrate the proposed model’s effectiveness and superiority over baseline methods. The source codes and datasets are both available on the public link: https://***/lianxiaoyu724/GBFRS Copyright © 2025, The Authors. All rights reserved.

关键词： Granular computing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：