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

Interpreting dense retrieval as mixture of topics

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Zhan, Jingtao Mao, Jiaxin Liu, Yiqun Guo, Jiafeng Zhang, Min Ma, Shaoping Department of Computer Science and Technology Institute for Artificial Intelligence Beijing National Research Center for Information Science and Technology Tsinghua University Beijing100084 China Beijing Key Laboratory of Big Data Management and Analysis Methods Gaoling School of Artificial Intelligence Renmin University of China Beijing100872 China CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China

Dense Retrieval (DR) reaches state-of-the-art results in first-stage retrieval, but little is known about the mechanisms that contribute to its success. Therefore, in this work, we conduct an interpretation study of recently proposed DR models. Specifically, we first discretize the embeddings output by the document and query encoders. Based on the discrete representations, we analyze the attribution of input tokens. Both qualitative and quantitative experiments are carried out on public test collections. Results suggest that DR models pay attention to different aspects of input and extract various high-level topic representations. Therefore, we can regard the representations learned by DR models as a mixture of high-level topics. Copyright © 2021, The Authors. All rights reserved.

关键词： Mixtures

Learning discrete representations via constrained clustering for effective and efficient dense retrieval

学校读者我要写书评

暂无评论

arXiv 2021年

Dense Retrieval (DR) has achieved state-of-the-art first-stage ranking effectiveness. However, the efficiency of most existing DR models is limited by the large memory cost of storing dense vectors and the time-consuming nearest neighbor search (NNS) in vector space. Therefore, we present RepCONC, a novel retrieval model that learns discrete Representations via CONstrained Clustering. RepCONC jointly trains dual-encoders and the Product Quantization (PQ) method to learn discrete document representations and enables fast approximate NNS with compact indexes. It models quantization as a constrained clustering process, which requires the document embeddings to be uniformly clustered around the quantization centroids and supports end-to-end optimization of the quantization method and dual-encoders. We theoretically demonstrate the importance of the uniform clustering constraint in RepCONC and derive an efficient approximate solution for constrained clustering by reducing it to an instance of the optimal transport problem. Besides constrained clustering, RepCONC further adopts a vector-based inverted file system (IVF) to support highly efficient vector search on CPUs. Extensive experiments on two popular ad-hoc retrieval benchmarks show that RepCONC achieves better ranking effectiveness than competitive vector quantization baselines under different compression ratio settings. It also substantially outperforms a wide range of existing retrieval models in terms of retrieval effectiveness, memory efficiency, and time efficiency. Copyright © 2021, The Authors. All rights reserved.

关键词： Signal encoding

Impact of China Railway Express on Urban Exports: Evidence from Prefectural-Level City Economic data

学校读者我要写书评

暂无评论

Procedia computer science 2022年 214卷 1222-1227页

作者： Bochao Yan Xin Tian Shiyong Deng Junfeng Wu Research Center on Fictitious Economy and Data Science Chinese Academy of Sciences Beijing 100190 China School of Economics and Management University of Chinese Academy of Sciences Beijing 100190 China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing 100190 China China Railway Fifth Survey and Design Institute Group Co. Ltd. Beijing 102600 China Shanghai WinJoin Information Technology Co. Ltd. Shanghai 200126 China

As a key project of infrastructure connectivity in the “Five-Pronged Approach” of strategic construction “The Belt and Road”, the China Railway Express, has significantly improved the level of trade level in countries along the railway. This study uses an empirical model to correlate the container export data of China Railway Express from June 2020 to June 2021 with the export value and finds that the trade volume of China Railway Express is positively correlated with the export value of cities. The relationship between the operation of the China Railway Express and the export trade of cities that enjoy the rail service is rigorously explained through the actual data of the operation of the China Railway Express provided by the enterprises. The empirical results further prove the positive impact of the China Railway Express on cities that enjoy the rail service.

关键词： The Belt Road China Railway Express Trade

Mandari: Multi-Modal Temporal knowledge Graph-aware Sub-graph Embedding for Next-POI Recommendation

学校读者我要写书评

暂无评论

Mandari: Multi-Modal Temporal Knowledge Graph-aware Sub-grap...

IEEE International Conference on Multimedia and Expo (ICME)

作者： Xiaoqian Liu Xiuyun Li Yuan Cao Fan Zhang Xiongnan Jin Jinpeng Chen School of Computer Science (National Pilot Software Engineering School) Beijing University of Posts and Telecommunications Beijing China Key Laboratory of Trustworthy Distributed Computing and Service (BUPT) Ministry of Education Beijing China The Technology Innovation Center of Cultural Tourism Big Data of Hebei Province Chengde China Hebei Normal University for Nationalities Chengde China Knowledge Discovery and Data Mining Research Center Zhejiang Lab Hangzhou China

Next-POI recommendation aims to explore from user check-in sequence to predict the next possible location to be visited. Existing methods are often difficult to model the implicit association of multi-modal data with user choices. Moreover, traditional methods struggle to fully explore the variation of user preferences at variable time intervals. To tackle these limitations, we propose a Multi-Modal Temporal knowledge Graph-aware Sub-graph Embedding approach (Mandari). We first construct a novel Multi-Modal Temporal knowledge Graph. Based on the proposed knowledge graph, we integrate multi-modal information and leverage the graph attention network to calculate sub-graph prediction probability. Next, we implement a temporal knowledge mining method to model the segmentation and periodicity of user check-in and obtain temporal prediction probability. Finally, we fuse temporal prediction probability with the previous sub-graph prediction probability to obtain the final result. Extensive experiments demonstrate that our approach outperforms existing state-of-the-art methods.

关键词：

Boosting Factorization Machines via Saliency-Guided Mixup

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Wu, Chenwang Lian, Defu Ge, Yong Zhou, Min Chen, Enhong Tao, Dacheng School of Data Science University of Science and Technology of China Anhui Hefei230000 China Anhui Province Key Laboratory of Big Data Analysis and Application School of Computer Science and Technology University of Science and Technology of China Anhui Hefei230000 China Eller College of Management University of Arizona United States Huawei Noah’s Ark Lab Hong Kong JD Explore Academy in *** China University of Sydney Australia

Factorization machines (FMs) are widely used in recommender systems due to their adaptability and ability to learn from sparse data. However, for the ubiquitous non-interactive features in sparse data, existing FMs can only estimate the parameters corresponding to these features via the inner product of their embeddings. Undeniably, they cannot learn the direct interactions of these features, which limits the model’s expressive power. To this end, we first present MixFM, inspired by Mixup, to generate auxiliary training data to boost FMs. Unlike existing augmentation strategies that require labor costs and expertise to collect additional information such as position and fields, these extra data generated by MixFM only by the convex combination of the raw ones without any professional knowledge support. More importantly, if the parent samples to be mixed have non-interactive features, MixFM will establish their direct interactions. Second, considering that MixFM may generate redundant or even detrimental instances, we further put forward a novel Factorization Machine powered by Saliency-guided Mixup (denoted as SMFM). Guided by the customized saliency, SMFM can generate more informative neighbor data. Through theoretical analysis, we prove that the proposed methods minimize the upper bound of the generalization error, which hold a beneficial effect on enhancing FMs. Significantly, we give the first generalization bound of FM, implying the generalization requires more data and a smaller embedding size under the sufficient representation capability. Finally, extensive experiments on five datasets confirm that our approaches are superior to baselines. Besides, the results show that"poisoning" mixed data is likewise beneficial to the FM variants. Copyright © 2022, The Authors. All rights reserved.

关键词： Recommender systems

The impact of the change of trade pattern on China’s energy industry——Based on the measurement of the upstreamness of production of the value chains

学校读者我要写书评

暂无评论

Procedia computer science 2018年 139卷 248-255页

作者： Xinran Wang Xiaoxian Guo Yan Song Shasha Cao Tian Wu Xin Tian Zhenping Li Shanghai Pudong Development Bank Shnaghai 200000 China China Petroleum Technology and Development Corporation Beijing 100028 China Research Center on Fictitious Economy and Data Science Chinese Academy of Sciences Beijing 100190 China School of Economics and Management University of Chinese Academy of Sciences Beijing 100190 China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing 100190 China NCMIS Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing 100190 China School of Information Beijing Wuzi University Beijing 101149 China

The natural monopoly of China’s upstream industry and the vertical structure of industrial chain’s upstream and downstream competition is an important feature of China’s industrial economic structure, and the impact of the change of trade pattern on the energy industry, which located at the upstream of the China’s value chain, has become an important issue in the industrial economy. Since China has entered into the WTO in 2001, we use it for event analysis based on 1987-2007 China input-output data. The study calculates the upstreamness of production of the value chain in various industrial sectors of China’s energy industry every five years, and make correlation analysis of upstreamness of production and other economic indicators to check the characteristics of periodic inspection of China’s industrial structure with the development of industrial economy and the change of trade pattern.

关键词： Energy industry industrial economic structure upstreamness of production trade pattern

Structure-Aware DropEdge Towards Deep Graph Convolutional Networks

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Han, Jiaqi Huang, Wenbing Rong, Yu Xu, Tingyang Sun, Fuchun Huang, Junzhou Department of Computer Science and Technology Tsinghua University Beijing China Gaoling School of Artificial Intelligence Renmin University of China Beijing Key Laboratory of Big Data Management and Analysis Methods Beijing China Tencent AI Lab Shenzhen China Department of Computer Science and Engineering The University of Texas Arlington United States

It has been discovered that Graph Convolutional Networks (GCNs) encounter a remarkable drop in performance when multiple layers are piled up. The main factor that accounts for why deep GCNs fail lies in over-smoothing, which isolates the network output from the input with the increase of network depth, weakening expressivity and trainability. In this paper, we start by investigating refined measures upon DropEdge—an existing simple yet effective technique to relieve over-smoothing. We term our method as DropEdge++ for its two structure-aware samplers in contrast to DropEdge: layer-dependent sampler and feature-dependent sampler. Regarding the layer-dependent sampler, we interestingly find that increasingly sampling edges from the bottom layer yields superior performance than the decreasing counterpart as well as DropEdge. We theoretically reveal this phenomenon with Mean-Edge-Number (MEN), a metric closely related to over-smoothing. For the feature-dependent sampler, we associate the edge sampling probability with the feature similarity of node pairs, and prove that it further correlates the convergence subspace of the output layer with the input features. Extensive experiments on several node classification benchmarks, including both full- and semi- supervised tasks, illustrate the efficacy of DropEdge++ and its compatibility with a variety of backbones by achieving generally better performance over DropEdge and the no-drop version. Copyright © 2023, The Authors. All rights reserved.

关键词： Drops

Automatically labeling Aging Scenarios with a Machine Learning Approach 1

学校读者我要写书评

暂无评论

24th International Conference on Human-computer Interaction, HCII 2022

作者： An, Ning Xu, Yang Gao, Qinglin Zhu, Wenjie Wu, Aoran Chen, Honglin School of Computer Science and Information Engineering Hefei University of Technology Hefei China Key Laboratory of Knowledge Engineering with Big Data of Ministry of Education Hefei University of Technology Hefei China National Smart Eldercare International S&T Cooperation Base Hefei University of Technology Hefei China Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei China Shanghai Tianyu Senior Living Service Co. Ltd. Shanghai China School of Basic Courses Bengbu Medical College Bengbu China Management and Business Department Skidmore College Saratoga SpringsNY United States Department of Social Sciences University of Eastern Finland Kuopio70150 Finland

ISBN: (数字)9783031179020

ISBN: (纸本)9783031179013

Older adults have diversified needs often associated with particular aging scenarios. People started to use aging scenarios to provide better Smart Eldercare services and develop innovative solutions. The problem is how to manage these scenarios effectively. To our best knowledge, this study is the first to develop a model to provide a structured framework of aging scenarios for research and teaching of eldercare services. labeling aging scenarios can facilitate their collection, classification, and consolidation within this model. This study uses the automatic labeling approach to manage and utilize aging scenarios. Under each class, there are labels with different numbers and smaller granularity to reflect the requirements in each scenario case. Since a scenario case often involves more than one label, properly labeling it becomes a multi-label text classification problem. We extend the multi-label text classification model LSAN for labeling aging scenario cases. For evaluation purposes, we collected 938 scenario cases as the dataset. Experimental results show that our proposed method can achieve an average accuracy of 61.66%, better than other classical methods. © 2022, Springer Nature Switzerland AG.

关键词： Classification (of information)

Structure-aware random fourier kernel for graphs 21

学校读者我要写书评

暂无评论

Structure-aware random fourier kernel for graphs

Proceedings of the 35th International Conference on Neural Information Processing Systems

作者： Jinyuan Fang Qiang Zhang Zaiqiao Meng Shangsong Liang School of Computer Science and Engineering Sun Yat-sen University China and Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China Hangzhou Innovation Center Zhejiang University China and College of Computer Science and Technology Zhejiang University China and AZFT Knowledge Engine Lab China School of Computing Science University of Glasgow United Kingdom and Mohamed bin Zayed University of Artificial Intelligence United Arab Emirates School of Computer Science and Engineering Sun Yat-sen University China and Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China and Mohamed bin Zayed University of Artificial Intelligence United Arab Emirates

ISBN: (纸本)9781713845393

Gaussian Processes (GPs) define distributions over functions and their generalization capabilities depend heavily on the choice of kernels. In this paper, we propose a novel structure-aware random Fourier (SRF) kernel for GPs that brings several benefits when modeling graph-structured data. First, SRF kernel is defined with a spectral distribution based on the Fourier duality given by the Bochner's theorem, transforming the kernel learning problem to a distribution inference problem. Second, SRF kernel admits a random Fourier feature formulation that makes the kernel scalable for optimization. Third, SRF kernel enables to leverage geometric structures by taking subgraphs as inputs. To effectively optimize GPs with SRF kernel, we develop a variational EM algorithm, which alternates between an inference procedure (E-step) and a learning procedure (M-step). Experimental results on five real-world datasets show that our model can achieve state-of-the-art performance in two typical graph learning tasks, i.e., object classification and link prediction.

关键词：