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

RPR-Net: A Point Cloud-based Rotation-aware Large Scale Place Recognition Network

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Fan, Zhaoxin Song, Zhenbo Zhang, Wenping Liu, Hongyan He, Jun Du, Xiaoyong Key Laboratory of Data Engineering and Knowledge Engineering of MOE School of Information Renmin University of China Beijing100872 China Department of Management Science and Engineering Tsinghua University Beijing100084 China School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing210094 China

Point cloud-based large scale place recognition is an important but challenging task for many applications such as Simultaneous Localization and Mapping (SLAM). Taking the task as a point cloud retrieval problem, previous methods have made delightful achievements. However, how to deal with catastrophic collapse caused by rotation problems is still under-explored. In this paper, to tackle the issue, we propose a novel Point Cloud-based Rotation-aware Large Scale Place Recognition Network (RPR-Net). In particular, to solve the problem, we propose to learn rotation-invariant features in three steps. First, we design three kinds of novel Rotation-Invariant Features (RIFs), which are low-level features that can hold the rotation-invariant property. Second, using these RIFs, we design an attentive module to learn rotation-invariant kernels. Third, we apply these kernels to previous point cloud features to generate new features, which is the well-known SO(3) mapping process. By doing so, high-level scene-specific rotation-invariant features can be learned. We call the above process an Attentive Rotation-Invariant Convolution (ARIConv). To achieve the place recognition goal, we build RPR-Net, which takes ARIConv as a basic unit to construct a dense network architecture. Then, powerful global descriptors used for retrieval-based place recognition can be sufficiently extracted from RPR-Net. Experimental results on prevalent datasets show that our method achieves comparable results to existing state-of-the-art place recognition models and significantly outperforms other rotation-invariant baseline models when solving rotation problems. Copyright © 2021, The Authors. All rights reserved.

关键词： Network architecture

A Scheme for Kinship Reasoning based on Ontology

学校读者我要写书评

暂无评论

A Scheme for Kinship Reasoning based on Ontology

IEEE International Conference on Big knowledge (ICBK)

作者： Ru Chen Guliu Liu Yi Zhu Xindong Wu Ministry of Education Key Laboratory of Knowledge Engineering with Big Data School of Computer Science and Information Engineering Hefei University of Technology School of Information Engineering Yangzhou University Mininglamp Academy of Sciences Mininglamp Technology

ISBN: (纸本)9781665438599

With the rapid development of artificial intelligence and semantic networks, knowledge graphs have received extensive attention in various application domains. As a domain knowledge graph, a genealogical knowledge graph has significant research value in the family blood, family culture, and medical genetic analysis. However, as the identical relationship often has different names and complex relationships such as divorce, remarriage, and polygamy, the reasoning based on the genealogical knowledge graph is a challenging task. In response to this problem, we propose a scheme for kinship reasoning in the genealogical knowledge graph. First, based on real genealogical revision experiences, a character ontology framework in the genealogical knowledge graph is defined, and basic kinship reasoning rules are designed. Then, given different definitions of kinship in different surnames, the solution of custom reasoning rules is integrated into the reasoning framework. In addition, aiming at complex relationships in family trees, such as multiple generations of ancestors and multiple wives, a series of inference optimization methods are proposed. Finally, we implement this scheme in the Huapu system, and the experimental results conducted on a real genealogical dataset demonstrate the effectiveness and practicality of our proposed scheme.

关键词： knowledge engineering Conferences Semantics Optimization methods Ontologies Genetics Cognition

A Low-rank Matching Attention based Cross-modal Feature Fusion Method for Conversational Emotion Recognition

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Shou, Yuntao Liu, Huan Cao, Xiangyong Meng, Deyu Dong, Bo School of Computer Science and Technology The Ministry of Education Key Laboratory for Intelligent Networks and Network Security The Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong Shaanxi Xi’an710049 China School of Computer Science and Technology Xi’an Jiaotong Shaanxi Xi’an710049 China The BigKE Joint Innovation Center SHMEEA Shanghai China School of Mathematics and Statistics Xi’an Jiaotong University Xi’an China

Conversational emotion recognition (CER) is an important research topic in human-computer interactions. Although recent advancements in transformer-based cross-modal fusion methods have shown promise in CER tasks, they tend to overlook the crucial intra-modal and inter-modal emotional interaction or suffer from high computational complexity. To address this, we introduce a novel and lightweight cross-modal feature fusion method called Low-Rank Matching Attention Method (LMAM). LMAM effectively captures contextual emotional semantic information in conversations while mitigating the quadratic complexity issue caused by the self-attention mechanism. Specifically, by setting a matching weight and calculating inter-modal features attention scores row by row, LMAM requires only one-third of the parameters of self-attention methods. We also employ the low-rank decomposition method on the weights to further reduce the number of parameters in LMAM. As a result, LMAM offers a lightweight model while avoiding overfitting problems caused by a large number of parameters. Moreover, LMAM is able to fully exploit the intra-modal emotional contextual information within each modality and integrates complementary emotional semantic information across modalities by computing and fusing similarities of intra-modal and inter-modal features simultaneously. Experimental results verify the superiority of LMAM compared with other popular cross-modal fusion methods on the premise of being more lightweight. Also, LMAM can be embedded into any existing state-of-the-art CER methods in a plug-and-play manner, and can be applied to other multi-modal recognition tasks, e.g., session recommendation and humour detection, demonstrating its remarkable generalization ability. Copyright © 2023, The Authors. All rights reserved.

关键词： Semantics

Zero-knowledge Proof Meets Machine Learning in Verifiability: A Survey

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Xing, Zhibo Zhang, Zijian Liu, Jiamou Zhang, Ziang Li, Meng Zhu, Liehuang Russello, Giovanni The School of Cyberspace Science and Technology Beijing Institute of Technology Beijing China The School of Computer Science The University of Auckland Auckland New Zealand Southeast Institute of Information Technology Beijing Institute of Technology Fujian China Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education School of Computer Science and Information Engineering Hefei University of Technology Anhui Hefei230601 China Anhui Province Key Laboratory of Industry Safety and Emergency Technology Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology China

With the rapid advancement of artificial intelligence technology, the usage of machine learning models is gradually becoming part of our daily lives. High-quality models rely not only on efficient optimization algorithms but also on the training and learning processes built upon vast amounts of data and computational power. However, in practice, due to various challenges such as limited computational resources and data privacy concerns, users in need of models often cannot train machine learning models locally. This has led them to explore alternative approaches such as outsourced learning and federated learning. While these methods address the feasibility of model training effectively, they introduce concerns about the trustworthiness of the training process since computations are not performed locally. Similarly, there are trustworthiness issues associated with outsourced model inference. These two problems can be summarized as the trustworthiness problem of model computations: How can one verify that the results computed by other participants are derived according to the specified algorithm, model, and input data? To address this challenge, verifiable machine learning (VML) has emerged. This paper presents a comprehensive survey of zero-knowledge proof-based verifiable machine learning (ZKP-VML) technology. We first analyze the potential verifiability issues that may exist in different machine learning scenarios. Subsequently, we provide a formal definition of ZKP-VML. We then conduct a detailed analysis and classification of existing works based on their technical approaches. Finally, we discuss the key challenges and future directions in the field of ZKP-based VML. © 2023, CC BY.

关键词： Machine learning

Audio Segmentation Techniques and Applications Based on Deep Learning

学校读者我要写书评

暂无评论

Scientific Programming 2022年第0期2022卷

作者： Aggarwal, Shruti Vasukidevi, G. Selvakanmani, S. Pant, Bhaskar Kaur, Kiranjeet Verma, Amit Binegde, Geleta Negasa Department of Computer Science and Engineering Thapar University Punjab Patiala147004 India Department of Science and Humanities R.M.K. College of Engineering and Technology R.S.M. Nagar Tamil Nadu Puduvoyal India Department of Artificial Intelligence and Data Science Velammal Institute of Technology Velammal Knowledge Park Tamil Nadu Chennai India Department of Computer Science and Engineering Graphic Era Deemed to be University Bell Road Clement Town Uttarakhand Dehradun248002 India University Center for Research and Development Chandigarh University Punjab Ajitgarh India Department of Computer Science College of Engineering and Technology Mettu University Metu Ethiopia

Audio processing has become an inseparable part of modern applications in domains ranging from health care to speech-controlled devices. In automated audio segmentation, deep learning plays a vital role. In this article, we are discussing audio segmentation based on deep learning. Audio segmentation divides the digital audio signal into a sequence of segments or frames and then classifies these into various classes such as speech recognition, music, or noise. Segmentation plays an important role in audio signal processing. The most important aspect is to secure a large amount of high-quality data when training a deep learning network. In this study, various application areas, citation records, documents published year-wise, and source-wise analysis are computed using Scopus and Web of science (WoS) databases. The analysis presented in this paper supports and establishes the significance of the deep learning techniques in audio segmentation. Copyright © 2022 Shruti Aggarwal et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

关键词： Speech recognition

XCoref: Cross-document coreference resolution in the wild

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Zhukova, Anastasia Hamborg, Felix Donnay, Karsten Gipp, Bela Data and Knowledge Engineering University of Wuppertal Germany Dept. of Computer Science University of Konstanz Germany Dept. of Political Science University of Zurich Switzerland Heidelberg Academy of Sciences and Humanities Germany

datasets and methods for cross-document coreference resolution (CDCR) focus on events or entities with strict coreference relations. They lack, however, annotating and resolving coreference mentions with more abstract or loose relations that may occur when news articles report about controversial and polarized events. Bridging and loose coreference relations trigger associations that may lead to exposing news readers to bias by word choice and labeling. For example, coreferential mentions of "direct talks between U.S. President Donald Trump and Kim" such as "an extraordinary meeting following months of heated rhetoric" or "great chance to solve a world problem" form a more positive perception of this event. A step towards bringing awareness of bias by word choice and labeling is the reliable resolution of coreferences with high lexical diversity. We propose an unsupervised method named XCoref, which is a CDCR method that capably resolves not only previously prevalent entities, such as persons, e.g., "Donald Trump," but also abstractly defined concepts, such as groups of persons, "caravan of immigrants," events and actions, e.g., "marching to the U.S. border." In an extensive evaluation, we compare the proposed XCoref to a state-of-the-art CDCR method and a previous method TCA that resolves such complex coreference relations and find that XCoref outperforms these methods. Outperforming an established CDCR model shows that the new CDCR models need to be evaluated on semantically complex mentions with more loose coreference relations to indicate their applicability of models to resolve mentions in the "wild" of political news articles. © 2021, CC BY.

关键词：

The Effect of Online Channel Addition on Store Performance:Empirical Evidence from Chinese Chain Retailers

学校读者我要写书评

暂无评论

Journal of Systems science and Information 2021年第4期9卷 356-377页

作者： Yixin WANG Qiguo GONG Tingyan WANG Xin TIAN School of Economics and Management University of Chinese Academy of SciencesBeijing 100190China Shanghai HEADING Information Engineering Co. LtdShanghai 201112China Key Labomtory of Big Data Mining and Knowledge Managements Chinese Academy of SciencesBeijing 100190China Nuffield Department of Medicine University of OxfordSouth Parks RoadOxford OXl 3SYUnited Kingdom NIHR Oxford Biomedical Research Centre Big Data InstituteUniversity of OxfordOld Road CampusOxford OX37LFUnited Kingdom Research Center on Fictitious Economy&Data Science Chinese Academy of SciencesBeijing 100190China

With the rapid development of e-Commerce and takeaway platforms, retailers have gradually developed multi-channel operations. However, limited empirical studies explored the effects of an online channel offered by takeaway platforms on the store performance. Does an online channel addition have a synergy effect or a cannibalization effect on store performance? We empirically investigate these effects by analyzing a large dataset including diverse samples collected from multiple retailers across various regions. The dataset includes 2115 stores across 25 retailers for 10 months that includes two types of retail formats and covers 16 provinces and 21 cities of China. We study the impacts of the newly introduced online channel on the incumbent offline channel and the overall store *** empirical results reveal that the online channel addition mainly has a synergy effect. Specifically,for the overall store, it has a positive effect on the sales and product variety, whereas it has a negative effect on the basket size. Surprisingly, an online channel addition also has a positive effect on the offline sales. Our study adds novel values to multi-channel retailing literature by empirically researching the cannibalization and synergy effect of a new type of online channel, offered by takeaway platforms. It can provide insights for retail enterprises who are interested in introducing O2 O model.

关键词： online channel addition cannibalization effect synergy effect propensity score matching(PSM) different-in-different(DID)method

ReconBoost: Boosting Can Achieve Modality Reconcilement

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Hua, Cong Xu, Qianqian Bao, Shilong Yang, Zhiyong Huang, Qingming Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Institute of Information Engineering Chinese Academy of Sciences Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China

This paper explores a novel multi-modal alternating learning paradigm pursuing a reconciliation between the exploitation of uni-modal features and the exploration of cross-modal interactions. This is motivated by the fact that current paradigms of multi-modal learning tend to explore multi-modal features simultaneously. The resulting gradient prohibits further exploitation of the features in the weak modality, leading to modality competition, where the dominant modality overpowers the learning process. To address this issue, we study the modality-alternating learning paradigm to achieve reconcilement. Specifically, we propose a new method called ReconBoost to update a fixed modality each time. Herein, the learning objective is dynamically adjusted with a reconcilement regularization against competition with the historical models. By choosing a KL-based reconcilement, we show that the proposed method resembles Friedman's Gradient-Boosting (GB) algorithm, where the updated learner can correct errors made by others and help enhance the overall performance. The major difference with the classic GB is that we only preserve the newest model for each modality to avoid overfitting caused by ensembling strong learners. Furthermore, we propose a memory consolidation scheme and a global rectification scheme to make this strategy more effective. Experiments over six multi-modal benchmarks speak to the efficacy of the method. We release the code at https://***/huacong/ReconBoost. Copyright © 2024, The Authors. All rights reserved.

关键词： Machine learning

knowledge Cores in large formal contexts

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Hanika, Tom Hirth, Johannes Knowledge and Data Engineering Group Dep. of Electrical Engineering and Computer Science University of Kassel

knowledge computation tasks are often infeasible for large data sets. This is in particular true when deriving knowledge bases in formal concept analysis (FCA). Hence, it is essential to come up with techniques to cope with this problem. Many successful methods are based on random processes to reduce the size of the investigated data set. This, however, makes them hardly interpretable with respect to the discovered knowledge. Other approaches restrict themselves to highly supported subsets and omit rare and interesting patterns. An essentially different approach is used in network science, called k-cores. These are able to reflect rare patterns if they are well connected in the data set. In this work, we study k-cores in the realm of FCA by exploiting the natural correspondence to bi-partite graphs. This structurally motivated approach leads to a comprehensible extraction of knowledge cores from large formal contexts data *** Codes 68T30 03G10 97R40 Copyright © 2020, The Authors. All rights reserved.

关键词： knowledge based systems