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

arXiv 2020年

作者： Li, Xirong Zhou, Fangming Xu, Chaoxi Ji, Jiaqi Yang, Gang Key Lab of Data Engineering and Knowledge Engineering AI & Media Computing Lab School of Information Renmin University of China Beijing100872 China

Retrieving unlabeled videos by textual queries, known as Ad-hoc Video Search (AVS), is a core theme in multimedia data management and retrieval. The success of AVS counts on cross-modal representation learning that encodes both query sentences and videos into common spaces for semantic similarity computation. Inspired by the initial success of previously few works in combining multiple sentence encoders, this paper takes a step forward by developing a new and general method for effectively exploiting diverse sentence encoders. The novelty of the proposed method, which we term Sentence Encoder Assembly (SEA), is two-fold. First, different from prior art that use only a single common space, SEA supports text-video matching in multiple encoder-specific common spaces. Such a property prevents the matching from being dominated by a specific encoder that produces an encoding vector much longer than other encoders. Second, in order to explore complementarities among the individual common spaces, we propose multi-space multi-loss learning. As extensive experiments on four benchmarks (MSR-VTT, TRECVID AVS 2016-2019, TGIF and MSVD) show, SEA surpasses the state-of-the-art. In addition, SEA is extremely ease to implement. All this makes SEA an appealing solution for AVS and promising for continuously advancing the task by harvesting new sentence encoders. © 2020, CC-BY.

关键词： Signal encoding

来源：评论

学校读者我要写书评

暂无评论

Graph Neural Networks with Learnable and Optimal Polynomial Bases

arXiv

引用

arXiv 2023年

作者： Guo, Yuhe Wei, Zhewei Gaoling School of Articial Intelligence Renmin University of China China Peng Cheng Laboratory China Beijing Key Laboratory of Big Data Management and Analysis Methods China MOE Key Lab of Data Engineering and Knowledge Engineering China

Polynomial filters, a kind of Graph Neural Networks, typically use a predetermined polynomial basis and learn the coefficients from the training data. It has been observed that the effectiveness of the model is highly dependent on the property of the polynomial basis. Consequently, two natural and fundamental questions arise: Can we learn a suitable polynomial basis from the training data? Can we determine the optimal polynomial basis for a given graph and node features? In this paper, we propose two spectral GNN models that provide positive answers to the questions posed above. First, inspired by Favard’s Theorem, we propose the FavardGNN model, which learns a polynomial basis from the space of all possible orthonormal bases. Second, we examine the supposedly unsolvable definition of optimal polynomial basis from Wang & Zhang (2022) and propose a simple model, OptBasisGNN, which computes the optimal basis for a given graph structure and graph signal. Extensive experiments are conducted to demonstrate the effectiveness of our proposed models. Our code is available at https://***/yuziGuo/FarOptBasis. © 2023, CC BY.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

3D Object Detection for Autonomous Driving: A Survey

arXiv

引用

arXiv 2021年

作者： Qian, Rui Lai, Xin Li, Xirong Key Lab of Data Engineering and Knowledge Engineering Renmin University of China Beijing100872 China School of Mathematics Renmin University of China Beijing100872 China

Autonomous driving is regarded as one of the most promising remedies to shield human beings from severe crashes. To this end, 3D object detection serves as the core basis of perception stack especially for the sake of path planning, motion prediction, and collision avoidance etc. Taking a quick glance at the progress we have made, we attribute challenges to visual appearance recovery in the absence of depth information from images, representation learning from partially occluded unstructured point clouds, and semantic alignments over heterogeneous features from cross modalities. Despite existing efforts, 3D object detection for autonomous driving is still in its infancy. Recently, a large body of literature have been investigated to address this 3D vision task. Nevertheless, few investigations have looked into collecting and structuring this growing knowledge. We therefore aim to fill this gap in a comprehensive survey, encompassing all the main concerns including sensors, datasets, performance metrics and the recent state-of-the-art detection methods, together with their pros and cons. Furthermore, we provide quantitative comparisons with the state of the art. A case study on fifteen selected representative methods is presented, involved with runtime analysis, error analysis, and robustness analysis. Finally, we provide concluding remarks after an in-depth analysis of the surveyed works and identify promising directions for future work. © 2021, CC BY.

关键词： Object recognition

来源：评论

学校读者我要写书评

暂无评论

Search Result Diversification Framework Based on Dual Star-shaped Self-Attention Network 20

Search Result Diversification Framework Based on Dual Star-s...

引用

20th Chinese National Conference on Computational Linguistics, CCL 2021

作者： Qin, Xubo Dou, Zhicheng Zhu, Yutao Wen, Ji-Rong School of Information Renmin University Gaoling School of Artificial Intelligence Renmin University of China Université de Montréal Beijing Key Laboratory of Big Data Management and Analysis Methods Key Laboratory of Data Engineering and Knowledge Engineering MOE

Research shows that most queries issued by users are short queries. Those queries may be ambiguous or broad for specifying users' actual information need. The same query issued by different users may lead to different information needs. In order to satisfy different users' needs, the search engines need to rank the search result document diversely. This leads to the search result diversification technology. For those previous diversification approaches based on global document interactions, fully-connected self-attention networks are used for capturing the interactions among all the candidate documents, leading to well performance. However, those models only take the document interactions into consideration, ignoring the relevance signals of candidate documents. As the annotated datasets are not enough for model training, the effectiveness of the model will be limited. In this paper we prove a new implicit diversification framework based on self-attention network in the shape of dual-star. A star-shaped topological structure is deployed with an external query node, in order to effectively extract the global interaction signals relevant to the query. Using self-attention to learn the similarity between each document, this model can be trained easily, and perform significantly better than the state-of-the-art implicit approach indicating the potential of implicit methods. © 2021 China National Conference on Computational Linguistics Published under Creative Commons Attribution 4.0 International License

关键词： Search engines

来源：评论

学校读者我要写书评

暂无评论

Interference and power constrained Broadcasting and Multicasting in wireless ad hoc networks with directional antennas

Interference and power constrained Broadcasting and Multicas...

引用

IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems (MASS)

作者： Zheng Li Deying Li Ming Liu Key Laboratory of Data Engineering and Knowledge Engineering MOE School of Information Renmin University of China China School of Computer Science and Engineering University of Electronic Science and Technology Chengdu China

ISBN: (纸本)9781424451142

Broadcasting/Multicasting problems have been well studied in wireless ad hoc networks. However, only a few approaches take into account the low interference and energy efficiency as the optimization objective simultaneously. In this paper, we study the interference and power constrained broadcast/multicast and the delay-bounded interference and power constrained broadcast/multicast routing problems in wireless ad hoc networks using directional antennas. We propose an approximation and a heuristic algorithm for the two problems, respectively. Importantly, motivated by the study of above optimization problems, we propose approximation schemes for two multi-constrained directed Steiner tree problems, respectively. Broadcast/Multicast message by using the trees found by our algorithms tend to have less channel collisions and higher network throughput. The theoretical results are corroborated by simulation studies.

关键词： Interference constraints Broadcasting Mobile ad hoc networks Directional antennas Multicast algorithms Energy efficiency Routing Approximation algorithms Heuristic algorithms Throughput

来源：评论

学校读者我要写书评

暂无评论

Simple and Deep Graph Convolutional Networks

arXiv

引用

arXiv 2020年

作者： Chen, Ming Wei, Zhewei Huang, Zengfeng Ding, Bolin Li, Yaliang School of Information Renmin University of China China Gaoling School of Articial Intelligence Renmin University of China China Beijing Key Lab of Big Data Management and Analysis Methods China MOE Key Lab of Data Engineering and Knowledge Engineering China School of Data Science Fudan University China Alibaba Group

Graph convolutional networks (GCNs) are a powerful deep learning approach for graph-structured data. Recently, GCNs and subsequent variants have shown superior performance in various application areas on real-world datasets. Despite their success, most of the current GCN models are shallow, due to the over-smoothing problem. In this paper, we study the problem of designing and analyzing deep graph convolutional networks. We propose the GCNII, an extension of the vanilla GCN model with two simple yet effective techniques: Initial residual and Identity mapping. We provide theoretical and empirical evidence that the two techniques effectively relieves the problem of over-smoothing. Our experiments show that the deep GCNII model outperforms the state-of-the-art methods on various semi- and full-supervised tasks. Code is available at https://***/chennnM/GCNII. Copyright © 2020, The Authors. All rights reserved.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Assessing the influence probability between objects: A random walker approach

Assessing the influence probability between objects: A rando...

引用

IEEE Symposium on Computational Intelligence and data Mining (CIDM)

作者： Pei Li Zhixu Li Jun He Xiaoyong Du Hongyan Liu Key Laboratories of Data Engineering and Knowledge Engineering MOE China & School of Information Renmin University of China Beijing China Department of Management Science and Engineering Tsinghua University Beijing China

Influence between objects needs to be assessed in many applications. Lots of measures have been proposed, but a domain-independent method is still expected. In this paper, we give a probabilistic definition of influence based on the random walker model on graphs. Two approaches, linear systems method and Basic InfRank algorithm, are shown and return equal results, but Basic InfRank is more efficient by iterative computation. Two variants on bipartite graphs and star graphs are discussed. Experiments show InfRank algorithms have good accuracy, fast convergent rate and high performance.

关键词： data engineering knowledge engineering Iterative algorithms Attenuation measurement Helium knowledge management engineering management Linear systems Iterative methods Bipartite graph

来源：评论

学校读者我要写书评

暂无评论

CompressStreamDB: Fine-Grained Adaptive Stream Processing without Decompression

CompressStreamDB: Fine-Grained Adaptive Stream Processing wi...

引用

International Conference on data engineering

作者： Yu Zhang Feng Zhang Hourun Li Shuhao Zhang Xiaoyong Du Key Laboratory of Data Engineering and Knowledge Engineering (MOE) and School of Information Renmin University of China Information Systems Technology and Design Pillar Singapore University of Technology and Design

Stream processing prevails and SQL query on streams has become one of the most popular application scenarios. For example, in 2021, the global number of active IoT endpoints reaches 12.3 billion. Unfortunately, the increasing scale of data and strict user requests place much pressure on existing stream processing systems, requiring high processing throughput with low latency. To further improve the performance of current stream processing systems, we propose a compression-based stream processing engine, called CompressStreamDB, which enables adaptive fine-grained stream processing directly on compressed streams, without decompression. Particularly, CompressStreamDB involves eight compression methods targeting various data types in streams, and it also provides a cost model for dynamically selecting the appropriate compression methods. By exploring data redundancy among streams, CompressStreamDB not only saves space in data transmission between client and server, but also achieves high throughput with low latency in SQL query on stream processing. Our experimental results show that compared to the state-of-the-art stream processing system on uncompressed streams, CompressStreamDB achieves 3.24× throughput improvement and 66.0% lower latency on average. Besides, CompressStreamDB saves 66.8% space.

关键词：

来源：评论

学校读者我要写书评

暂无评论

FOSS: A Self-Learned Doctor for Query Optimizer

FOSS: A Self-Learned Doctor for Query Optimizer

引用

International Conference on data engineering

作者： Kai Zhong Luming Sun Tao Ji Cuiping Li Hong Chen Renmin University of China China MOE Key Laboratory of Data Engineering and Knowledge Engineering China Shanghai Yunxi Technology Co. Ltd. Engineering Research Center of Database and Business Intelligence MOE China

ISBN: (数字)9798350317152

ISBN: (纸本)9798350317169

Various works have utilized deep learning to address the query optimization problem in database system. They either learn to construct plans from scratch in a bottom-up manner or steer the plan generation behavior of traditional optimizer using hints. While these methods have achieved some success, they face challenges in either low training efficiency or limited plan search space. To address these challenges, we introduce FOSS, a novel framework for query optimization based on deep reinforcement learning. FOSS initiates optimization from the original plan generated by a traditional optimizer and incrementally refines suboptimal nodes of the plan through a sequence of actions. Additionally, we devise an asymmetric advantage model to evaluate the advantage between two plans. We integrate it with a traditional optimizer to form a simulated environment. Leveraging this simulated environment, FOSS can bootstrap itself to rapidly generate a large amount of high-quality simulated experiences. FOSS then learns from these experiences to improve its optimization capability. We evaluate the performance of FOSS on Join Order Benchmark, TPC-DS, and Stack Overflow. The experimental results demonstrate that FOSS outperforms the state-of-the-art methods in terms of latency performance. Compared to PostgreSQL, FOSS achieves speedup ranging from 1.15x to 8.33x in total latency across different benchmarks.

关键词： Training Query processing Medical services Benchmark testing Deep reinforcement learning data engineering Distance measurement

来源：评论

学校读者我要写书评

暂无评论

Random analysis of statistical rough set

Random analysis of statistical rough set

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Eric C. C. Tsang Su-Yun Zhao Faculty of Information Technology Macau University of Science and Technology Macau China MOE Key Laboratory of Data Engineering and Knowledge Engineering (Renmin University of China) Beijing China

ISBN: (纸本)9781509003914

Attribute reduction is an inevitable problem in machine learning and statistical learning. To improve the traditional rough set reduction, statistical rough sets is then proposed by introducing random sampling into the rough approximation. Random sampling is the main contribution of statistical rough sets. As a result, it is necessary to analyze the randomness of statistical rough sets. In this paper, we analyze and demonstrate the influence of the randomness in the process of attribute reduction by a large number of experiments to test the effectiveness and stability of the random sampling.

关键词： Rough sets Standards Cybernetics Fluctuations Stability analysis Big data Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：