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

ER: Equivariance Regularizer for knowledge Graph Completion

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Cao, Zongsheng Xu, Qianqian Yang, Zhiyong Huang, Qingming State Key Laboratory of Information Security Institute of Information Engineering CAS Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology CAS Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China Peng Cheng Laboratory Shenzhen China

Tensor factorization and distanced based models play important roles in knowledge graph completion (KGC). However, the relational matrices in KGC methods often induce a high model complexity, bearing a high risk of overfitting. As a remedy, researchers propose a variety of different regularizers such as the tensor nuclear norm regularizer. Our motivation is based on the observation that the previous work only focuses on the "size" of the parametric space, while leaving the implicit semantic information widely untouched. To address this issue, we propose a new regularizer, namely, Equivariance Regularizer (ER), which can suppress overfitting by leveraging the implicit semantic information. Specifically, ER can enhance the generalization ability of the model by employing the semantic equivariance between the head and tail entities. Moreover, it is a generic solution for both distance based models and tensor factorization based models. The experimental results indicate a clear and substantial improvement over the state-of-the-art relation prediction methods. © 2022, CC BY.

关键词： knowledge graph

Document-level Relation Extraction with Relation Correlations

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Han, Ridong Peng, Tao Wang, Benyou Liu, Lu Wan, Xiang College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education China College of Software Jilin University China Shenzhen Research Institute of Big Data The Chinese University of Hong Kong Shenzhen China School of Data Science The Chinese University of Hong Kong Shenzhen China

Document-level relation extraction faces two overlooked challenges: long-tail problem and multi-label problem. Previous work focuses mainly on obtaining better contextual representations for entity pairs, hardly address the above challenges. In this paper, we analyze the co-occurrence correlation of relations, and introduce it into DocRE task for the first time. We argue that the correlations can not only transfer knowledge between data-rich relations and data-scarce ones to assist in the training of tailed relations, but also reflect semantic distance guiding the classifier to identify semantically close relations for multi-label entity pairs. Specifically, we use relation embedding as a medium, and propose two co-occurrence prediction sub-tasks from both coarse- and fine-grained perspectives to capture relation correlations. Finally, the learned correlation-aware embeddings are used to guide the extraction of relational facts. Substantial experiments on two popular DocRE datasets are conducted, and our method achieves superior results compared to baselines. Insightful analysis also demonstrates the potential of relation correlations to address the above challenges. Copyright © 2022, The Authors. All rights reserved.

关键词： Extraction

Block-Structured Optimization for Anomalous Pattern Detection in Interdependent Networks

学校读者我要写书评

暂无评论

Block-Structured Optimization for Anomalous Pattern Detectio...

IEEE International Conference on data Mining (ICDM)

作者： Fei Jie Chunpai Wang Feng Chen Lei Li Xindong Wu Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China Department of Computer Science University at Albany – SUNY Albany NY USA Erik Jonsson School of Engineering & Computer Science The University of Texas at Dallas Dallas TX USA Mininglamp Academy of Sciences Mininglamp Technology Beijing China Institute of Big Knowledge Science Hefei University of Technology Hefei China

We propose a generalized optimization framework for detecting anomalous patterns (subgraphs that are interesting or unexpected) in interdependent networks, such as multi-layer networks, temporal networks, networks of networks, and many others. We frame the problem as a non-convex optimization that has a general nonlinear score function and a set of block-structured and non-convex constraints. We develop an effective, efficient, and parallelizable projection-based algorithm, namely Graph Block-structured Gradient Projection (GBGP), to solve the problem. It is proved that our algorithm 1) runs in nearly-linear time on the network size, and 2) enjoys a theoretical approximation guarantee. Moreover, we demonstrate how our framework can be applied to two very practical applications, and we conduct comprehensive experiments to show the effectiveness and efficiency of our proposed algorithm.

关键词：

PWG-IDS: An intrusion detection model for solving class imbalance in IIoT networks using generative adversarial networks

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Zhang, Lei Jiang, Shuaimin Shen, Xiajiong Gupta, Brij B. Tian, Zhihong Henan Key Laboratory of Big Data Analysis and Processing Henan University Kaifeng47500 China Institute of Data and Knowledge Engineering Henan University Kaifeng47500 China School of Computer and Information Engineering Henan University Kaifeng47500 China National Institute of Technology Kurukshetra India Asia University Taichung Taiwan The Department of Cyberspace Insitute of Advanced Technology GuangZhou University GuangZhou510006 China

With the continuous development of industrial IoT (IIoT) technology, network security is becoming more and more important. And intrusion detection is an important part of its security. However, since the amount of attack traffic is very small compared to normal traffic, this imbalance makes intrusion detection in it very difficult. To address this imbalance, an intrusion detection system called pretraining Wasserstein generative adversarial network intrusion detection system (PWG-IDS) is proposed in this paper. This system is divided into two main modules: 1) In this module, we introduce the pretraining mechanism in the Wasserstein generative adversarial network with gradient penalty (WGAN-GP) for the first time, firstly using the normal network traffic to train the WGAN-GP, and then inputting the imbalance data into the pre-trained WGAN-GP to retrain and generate the final required data. 2) Intrusion detection module: We use LightGBM as the classification algorithm to detect attack traffic in IIoT networks. The experimental results show that our proposed PWG-IDS outperforms other models, with F1-scores of 99% and 89% on the 2 datasets, respectively. And the pretraining mechanism we proposed can also be widely used in other GANs, providing a new way of thinking for the training of GANs. Copyright © 2021, The Authors. All rights reserved.

关键词： Intrusion detection

Block-Structured Optimization for Subgraph Detection in Interdependent Networks

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Jie, Fei Wang, Chunpai Chen, Feng Li, Lei Wu, Xindong Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China Department of Computer Science University at Albany – SUNY AlbanyNY United States Erik Jonsson School of Engineering & Computer Science The University of Texas at Dallas DallasTX United States Mininglamp Academy of Sciences Mininglamp Technologies Beijing China Institute of Big Knowledge Science Hefei University of Technology Hefei China

We propose a generalized framework for block-structured nonconvex optimization, which can be applied to structured subgraph detection in interdependent networks, such as multi-layer networks, temporal networks, networks of networks, and many others. Specifically, we design an effective, efficient, and parallelizable projection algorithm, namely Graph Block-structured Gradient Projection (GBGP), to optimize a general non-linear function subject to graph-structured constraints. We prove that our algorithm: 1) runs in nearly-linear time on the network size;2) enjoys a theoretical approximation guarantee. Moreover, we demonstrate how our framework can be applied to two very practical applications and conduct comprehensive experiments to show the effectiveness and efficiency of our proposed algorithm. Copyright © 2022, The Authors. All rights reserved.

关键词： Functions

Pathological brain detection based on online sequential extreme learning machine

学校读者我要写书评

暂无评论

Pathological brain detection based on online sequential extr...

IEEE International Conference on Progress in Informatics and Computing (PIC)

作者： Siyuan Lu Hainan Wang Xueyan Wu Shuihua Wang School of Computer Science and Technology Nanjing Normal University Nanjing Jiangsu China State Key Lab of CAD & CG Zhejiang University Hangzhou Zhejiang China Key laboratory of symbolic computation and knowledge engineering of ministry of education Jilin University Changchun Jilin China Key Laboratory of Statistical information technology and data mining State Statistics Bureau Chengdu Sichuan China Department of Electrical Engineering CUNY New York NY USA

ISBN: (纸本)9781509034857

Magnetic resonance imaging (MRI) is a kind of imaging modality, which offers clearer images of soft tissues than computed tomography (CT). It is especially suitable for brain disease detection. It is beneficial to detect diseases automatically and accurately. We proposed a pathological brain detection method based on brain MR images and online sequential extreme learning machine. First, seven wavelet entropies (WE) were extracted from each brain MR image to form the feature vector. Then, an online sequential extreme learning machine (OS-ELM) was trained to differentiate pathological brains from the healthy controls. The experiment results over 132 brain MRIs showed that the proposed approach achieved a sensitivity of 93.51%, a specificity of 92.22%, and an overall accuracy of 93.33%, which suggested that our method is effective.

关键词： Entropy Discrete wavelet transforms Feature extraction Pathology Training Magnetic resonance imaging Diseases

Geometry Interaction knowledge Graph Embeddings

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Cao, Zongsheng Xu, Qianqian Yang, Zhiyong Cao, Xiaochun Huang, Qingming State Key Laboratory of Information Security Institute of Information Engineering CAS Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology CAS Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China Peng Cheng Laboratory Shenzhen China

knowledge graph (KG) embeddings have shown great power in learning representations of entities and relations for link prediction tasks. Previous work usually embeds KGs into a single geometric space such as Euclidean space (zero curved), hyperbolic space (negatively curved) or hyperspherical space (positively curved) to maintain their specific geometric structures (e.g., chain, hierarchy and ring structures). However, the topological structure of KGs appears to be complicated, since it may contain multiple types of geometric structures simultaneously. Therefore, embedding KGs in a single space, no matter the Euclidean space, hyperbolic space or hyperspheric space, cannot capture the complex structures of KGs accurately. To overcome this challenge, we propose Geometry Interaction knowledge graph Embeddings (GIE), which learns spatial structures interactively between the Euclidean, hyperbolic and hyperspherical spaces. Theoretically, our proposed GIE can capture a richer set of relational information, model key inference patterns, and enable expressive semantic matching across entities. Experimental results on three well-established knowledge graph completion benchmarks show that our GIE achieves the state-of-the-art performance with fewer parameters. © 2022, CC BY.

关键词： knowledge graph

Fast One-Stage Unsupervised Domain Adaptive Person Search

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Cui, Tianxiang Wang, Huibing Peng, Jinjia Deng, Ruoxi Fu, Xianping Wang, Yang The College of Information and Science Technology Dalian Maritime University China The College School of Cyber Security and Computer Hebei University China The College of Computer Science and Artificial Intelligence Wenzhou University China Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology China

Unsupervised person search aims to localize a particular target person from a gallery set of scene images without annotations, which is extremely challenging due to the unexpected variations of the unlabeled domains. However, most existing methods dedicate to developing multi-stage models to adapt domain variations while using clustering for iterative model training, which inevitably increases model complexity. To address this issue, we propose a Fast One-stage Unsupervised person Search (FOUS) which complementary integrates domain adaptaion with label adaptaion within an end-to-end manner without iterative clustering. To minimize the domain discrepancy, FOUS introduced an Attention-based Domain Alignment Module (ADAM) which can not only align various domains for both detection and ReID tasks but also construct an attention mechanism to reduce the adverse impacts of low-quality candidates resulting from unsupervised detection. Moreover, to avoid the redundant iterative clustering mode, FOUS adopts a prototype-guided labeling method which minimizes redundant correlation computations for partial samples and assigns noisy coarse label groups efficiently. The coarse label groups will be continuously refined via label-flexible training network with an adaptive selection strategy. With the adapted domains and labels, FOUS can achieve the state-of-the-art (SOTA) performance on two benchmark datasets, CUHK-SYSU and PRW. The code is available at https://***/whbdmu/FOUS © 2024, CC0.

关键词： Iterative methods

Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification

学校读者我要写书评

暂无评论

Learning Structured Twin-Incoherent Twin-Projective Latent D...

IEEE International Conference on data Mining (ICDM)

作者： Zhao Zhang Yulin Sun Zheng Zhang Yang Wang Guangcan Liu Meng Wang School of Computer Science and Technology Soochow University Suzhou China Key Laboratory of Knowledge Engineering with Big Data (Ministry of Education) Hefei University of Technology School of Computer Science and Information Engineering Hefei University of Technology Hefei China Bio-Computing Research Center Harbin Institute of Technology (Shenzhen) Shenzhen China School of Information and Control Nanjing University of Information Science and Technology Nanjing China

In this paper, we extend the popular dictionary pair learning (DPL) into the scenario of twin-projective latent flexible DPL under a structured twin-incoherence. Technically, a novel framework called Twin-Projective Latent Flexible DPL (TP-DPL) is proposed, which minimizes the twin-incoherence constrained flexibly-relaxed reconstruction error to avoid the possible over-fitting issue and produce accurate reconstruction. In this setting, TP-DPL integrates the twin-incoherence based latent flexible DPL and the joint embedding of codes as well as salient features by twin-projection into a unified model in an adaptive neighborhood-preserving manner. Therefore, TP-DPL can unify the procedures of salient feature representation and classification. The twin-incoherence constraint on coefficients and features can explicitly ensure high intra-class compactness and inter-class separation over them. TP-DPL also integrates the adaptive weighting to preserve local neighborhood of both coefficients and salient features within each class explicitly. For efficiency, TP-DPL selects the Frobenius-norm and abandons the costly l0/l1-norm for group sparse representation. Another byproduct is that TP-DPL can directly apply the class-specific twin-projective reconstruction residual to compute the label of data. Extensive results on public databases show that TP-DPL can deliver the state-of-the-art performance.

关键词：