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

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

作者： Huang, Junjie Cao, Qi Xie, Ruobing Zhang, Shaoliang Xia, Feng Shen, Huawei Cheng, Xueqi Data Intelligence System Research Center Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China WeChat Tencent Beijing China CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China

ISBN: (纸本)9783031306716

Recently, Graph Neural networks (GNNs) achieve remarkable success in Recommendation. To reduce the influence of data sparsity, Graph Contrastive Learning (GCL) is adopted in GNN-based CF methods for enhancing performance. Most GCL methods consist of data augmentation and contrastive loss (e.g., InfoNCE). GCL methods construct the contrastive pairs by hand-crafted graph augmentations and maximize the agreement between different views of the same node compared to that of other nodes, which is known as the InfoMax principle. However, improper data augmentation will hinder the performance of GCL. InfoMin principle, that the good set of views shares minimal information and gives guidelines to design better data augmentation. In this paper, we first propose a new data augmentation (i.e., edge-operating including edge-adding and edge-dropping). Then, guided by InfoMin principle, we propose a novel theoretical guiding contrastive learning framework, named Learnable data Augmentation for Graph Contrastive Learning (LDA-GCL). Our methods include data augmentation learning and graph contrastive learning, which follow the InfoMin and InfoMax principles, respectively. In implementation, our methods optimize the adversarial loss function to learn data augmentation and effective representations of users and items. Extensive experiments on four public benchmark datasets demonstrate the effectiveness of LDA-GCL. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Learning to Localize Cross-Anatomy Landmarks in X-Ray Images with a Universal Model

引用

Biomedical Engineering Frontiers 2022年第1期3卷 298-308页

作者： Heqin Zhu Qingsong Yao Li Xiao S.Kevin Zhou Key Lab of Intelligent Information Processing of Chinese Academy of Sciences(CAS) Institute of Computing TechnologyCASBeijing 100190China Center for Medical Imaging RoboticsAnalytic Computing&Learning(MIRACLE)School of Biomedical Engineering&Suzhou Institute for Advanced ResearchUniversity of Science and Technology of ChinaSuzhou 215123China

Objective and Impact *** this work,we develop a universal anatomical landmark detection model which learns once from multiple datasets corresponding to different anatomical *** with the conventional model trained on a single dataset,this universal model not only is more light weighted and easier to train but also improves the accuracy of the anatomical landmark *** accurate and automatic localization of anatomical landmarks plays an essential role in medical image ***,recent deep learning-based methods only utilize limited data from a single *** is promising and desirable to build a model learned from different regions which harnesses the power of big *** model consists of a local network and a global network,which capture local features and global features,*** local network is a fully convolutional network built up with depth-wise separable convolutions,and the global network uses dilated convolution to enlarge the receptive field to model global *** evaluate our model on four 2D X-ray image datasets totaling 1710 images and 72 landmarks in four anatomical *** experimental results show that our model improves the detection accuracy compared to the state-of-the-art *** model makes the first attempt to train a single network on multiple datasets for landmark *** results qualitatively and quantitatively show that our proposed model performs better than other models trained on multiple datasets and even better than models trained on a single dataset separately.

关键词： convolution utilize separable

来源：评论

学校读者我要写书评

暂无评论

Type-Representation Enhanced Event Detection via Structure Encoder 1

Type-Representation Enhanced Event Detection via Structure E...

引用

1st IEEE International Conference on Medical Artificial Intelligence, MedAI 2023

作者： Feng, Yuming Huang, Linmeng Liang, Haozhe Jin, Xiaolong Guan, Saiping Guo, Jiafeng School of Computer Science and Technology University of Chinese Academy of Sciences China Institute of Computing Technology Chinese Academy of Sciences Key Lab of Network Data Science and Technology China Institute of Systems Engineering Academy of Military Science Beijing China

ISBN: (纸本)9798350358780

Event detection, aiming to detect whether a sentence contains the type of events of interest, is one of the important tasks in information Extraction. There exist many methods for event detection, which usually treat event detection as a classification problem. These existing methods suffer from the imbalanced training data of different event types. To relieve this problem, this paper proposes a new Type-Representation-Enhanced Event Detection (TREED) method, which introduce hierarchical event type representations to enhance classification accuracy. Specifically, TREED first models the hierarchical relationship among event types in the dataset;Next, upon interactions between the representations of trigger words and event types, it obtains the new representations of trigger words integrating event type information. Finally, TREED classifies the events based on the obtained more accurate trigger word representations. Experimental results on a commonly used benchmark dataset, ACE-2005, demonstrate that the proposed model can improve both accuracy and recall of the event detection task. © 2023 IEEE.

关键词： Signal encoding

来源：评论

学校读者我要写书评

暂无评论

One Comment from One Perspective: An Effective Strategy for Enhancing Automatic Music Comment 28

One Comment from One Perspective: An Effective Strategy for ...

引用

28th International Conference on Computational Linguistics, COLING 2020

作者： Huo, Tengfei Liu, Zhiqiang Zhang, Jinchao Zhou, Jie CAS Key Lab of Network Data Science and Technology China Institute of Computing Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences Beijing China Pattern Recognition Center WeChat AI Tencent Inc. China

ISBN: (纸本)9781952148279

The automatic generation of music comments is of great significance for increasing the popularity of music and the music platform’s activity. In human music comments, there exists high distinction and diverse perspectives for the same song. In other words, for a song, different comments stem from different musical perspectives. However, to date, this characteristic has not been considered well in research on automatic comment generation. The existing methods tend to generate common and meaningless comments. In this paper, we propose an effective multi-perspective strategy to enhance the diversity of the generated comments. The experiment results on two music comment datasets show that our proposed model can effectively generate a series of diverse music comments based on different perspectives, which outperforms state-of-the-art baselines by a substantial margin. © 2020 COLING 2020 - 28th International Conference on Computational Linguistics, Proceedings of the Conference. All rights reserved.

关键词： Music

来源：评论

学校读者我要写书评

暂无评论

Querying a matrix through matrix-vector products 46

Querying a matrix through matrix-vector products

引用

46th International Colloquium on Automata, Languages, and Programming, ICALP 2019

作者： Sun, Xiaoming Woodruff, David P. Yang, Guang Zhang, Jialin CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China Carnegie Mellon University PittsburghPA United States Institute of Computing Technology Chinese Academy of Sciences Beijing China Conflux Beijing China

ISBN: (纸本)9783959771092

We consider algorithms with access to an unknown matrix M ∈ Fn×d via matrix-vector products, namely, the algorithm chooses vectors v1,..., vq, and observes Mv1,..., Mvq. Here the vi can be randomized as well as chosen adaptively as a function of Mv1,..., Mvi−1. Motivated by applications of sketching in distributed computation, linear algebra, and streaming models, as well as connections to areas such as communication complexity and property testing, we initiate the study of the number q of queries needed to solve various fundamental problems. We study problems in three broad categories, including linear algebra, statistics problems, and graph problems. For example, we consider the number of queries required to approximate the rank, trace, maximum eigenvalue, and norms of a matrix M;to compute the AND/OR/Parity of each column or row of M, to decide whether there are identical columns or rows in M or whether M is symmetric, diagonal, or unitary;or to compute whether a graph defined by M is connected or triangle-free. We also show separations for algorithms that are allowed to obtain matrix-vector products only by querying vectors on the right, versus algorithms that can query vectors on both the left and the right. We also show separations depending on the underlying field the matrix-vector product occurs in. For graph problems, we show separations depending on the form of the matrix (bipartite adjacency versus signed edge-vertex incidence matrix) to represent the graph. Surprisingly, this fundamental model does not appear to have been studied on its own, and we believe a thorough investigation of problems in this model would be beneficial to a number of different application areas. © Xiaoming Sun, David P. Woodruff, Guang Yang, and Jialin Zhang;licensed under Creative Commons License CC-BY

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

What makes a successful rebuttal in computer science conferences?: A perspective on social interaction

What makes a successful rebuttal in computer science confere...

引用

作者： Huang, Junjie Huang, Win-bin Bu, Yi Cao, Qi Shen, Huawei Cheng, Xueqi Data Intelligence System Research Center Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China Department of Information Management Peking University Beijing China CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China

With an exponential increase in submissionsto top-tier Computer science (CS) conferences, more and more conferences have introduced a rebuttal stage to the conference peer review process. The rebuttal stage can be modeled as social interactions between authors and reviewers. A successful rebuttal often results in an increased review score after the rebuttal stage. In this paper, we conduct an empirical study to determine the factors contributing to a successful rebuttal using over 3000 papers and 13,000 reviews from ICLR2022, one of the most prestigious computer science conferences. First, we observe a significant difference in review scores before and after the rebuttal stage, which is crucial for paper acceptance. Furthermore, we investigate factors from the reviewer's perspective using signed social network analysis. A notable finding is the increase in balanced network structure after the rebuttal stage. Subsequently, we evaluate several quantifiable author rebuttal strategies and their effects on review scores. These strategies can help authors in improving their review scores. Finally, we used machine learning models to predict rebuttal success and validated the impact of potential factors analyzed in this paper. Our experiments demonstrate that the utilization of all features proposed in this study can aid in predicting the success of the rebuttal. In summary, this work presents a study on the impact factors of successful rebuttals from both reviewers’ and authors’ perspectives and lays the foundation for analyzing rebuttals with social network analysis. © 2023 Elsevier Ltd

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Learning Visual Features from Snapshots for Web Search

arXiv

引用

arXiv 2017年

作者： Fan, Yixing Guo, Jiafeng Lan, Yanyan Xu, Jun Pang, Liang Cheng, Xueqi University of Chinese Academy of Sciences CAS Key Lab of Network Data Science and Technology Institute of Computing Technology

When applying learning to rank algorithms to Web search, a large number of features are usually designed to capture the relevance signals. Most of these features are computed based on the extracted textual elements, link analysis, and user logs. However, Web pages are not solely linked texts, but have structured layout organizing a large variety of elements in different styles. Such layout itself can convey useful visual information, indicating the relevance of a Web page. For example, the query-independent layout (i.e., raw page layout) can help identify the page quality, while the query-dependent layout (i.e., page rendered with matched query words) can further tell rich structural information (e.g., size, position and proximity) of the matching signals. However, such visual information of layout has been seldom utilized in Web search in the past. In this work, we propose to learn rich visual features automatically from the layout of Web pages (i.e., Web page snapshots) for relevance ranking. Both query-independent and query-dependent snapshots are considered as the new inputs. We then propose a novel visual perception model inspired by human’s visual search behaviors on page viewing to extract the visual features. This model can be learned end-to-end together with traditional human-crafted features. We also show that such visual features can be efficiently acquired in the online setting with an extended inverted indexing scheme. Experiments on benchmark collections demonstrate that learning visual features from Web page snapshots can significantly improve the performance of relevance ranking in ad-hoc Web retrieval tasks. Copyright © 2017, The Authors. All rights reserved.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Dynamic-K recommendation with personalized decision boundary

arXiv

引用

arXiv 2020年

作者： Gao, Yan Guo, Jiafeng Lan, Yanyan Liao, Huaming CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China

In this paper, we investigate the recommendation task in the most common scenario with implicit feedback (e.g., clicks, purchases). State-of-the-art methods in this direction usually cast the problem as to learn a personalized ranking on a set of items (e.g., webpages, products). The top-N results are then provided to users as recommendations, where the N is usually a fixed number pre-defined by the system according to some heuristic criteria (e.g., page size, screen size). There is one major assumption underlying this fixed-number recommendation scheme, i.e., there are always sufficient relevant items to users’ preferences. Unfortunately, this assumption may not always hold in real-world scenarios. In some applications, there might be very limited candidate items to recommend, and some users may have very high relevance requirement in recommendation. In this way, even the top-1 ranked item may not be relevant to a user’s preference. Therefore, we argue that it is critical to provide a dynamic-K recommendation, where the K should be different with respect to the candidate item set and the target user. We formulate this dynamic-K recommendation task as a joint learning problem with both ranking and classification objectives. The ranking objective is the same as existing methods, i.e., to create a ranking list of items according to users’ interests. The classification objective is unique in this work, which aims to learn a personalized decision boundary to differentiate the relevant items from irrelevant items. Based on these ideas, we extend two state-of-the-art ranking-based recommendation methods, i.e., BPRMF and HRM, to the corresponding dynamic-K versions, namely DK-BPRMF and DK-HRM. Our experimental results on two datasets show that the dynamic-K models are more effective than the original fixed-N recommendation methods. Copyright © 2020, The Authors. All rights reserved.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Design of Target Behavior Intelligent Analysis System Based on Distributed computing

Design of Target Behavior Intelligent Analysis System Based ...

引用

2019 IEEE International Conference on Signal, Information and data Processing, ICSIDP 2019

作者： Pan, Xinlong Cheng, Xueqi Yao, Libo Zhu, Zhenqiu DIng, Biao Tang, Tiantian Li, Minbo Liu, Chuanhui Institute of Information Fusion Naval Aviation University Yantai China CAS Key Laboratory of Network Data Science Technology Inistitute of Computing Technology Chinese Academy of Sciences Beijing China School of Software Fudan University Shanghai China

ISBN: (纸本)9781728123455

Through the fusion processing of target data obtained by radar, electronic reconnaissance, space reconnaissance, technical reconnaissance and civil cooperative system in early warning and surveillance system, multidimensional target data including explicit state information such as target attributes, type, position, speed and course could be obtained. The latent potential information, such as regular behavior, intention and threat degree, need to be mastered by human intelligence and experience analysis. It is urgent to use big data mining technology to realize intelligent analysis of target behavior. Based on the analysis of big data related technologies, this paper designs an intelligent target behavior analysis system based on distributed computing, which provides theoretical and technical support for intelligent upgrading of intelligence processing systems and command decision systems. © 2019 IEEE.

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

A deep investigation of deep IR models

arXiv

引用

arXiv 2017年

作者： Pang, Liang Lan, Yanyan Guo, Jiafeng Xu, Jun Cheng, Xueqi CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China

The effective of information retrieval (IR) systems have become more important than ever. Deep IR models have gained increasing attention for its ability to automatically learning features from raw text;thus, many deep IR models have been proposed recently. However, the learning process of these deep IR models resemble a black box. Therefore, it is necessary to identify the difference between automatically learned features by deep IR models and hand-crafted features used in traditional learning to rank approaches. Furthermore, it is valuable to investigate the differences between these deep IR models. This paper aims to conduct a deep investigation on deep IR models. Specifically, we conduct an extensive empirical study on two different datasets, including Robust and LETOR4.0. We first compared the automatically learned features and handcrafted features on the respects of query term coverage, document length, embeddings and robustness. It reveals a number of disadvantages compared with hand-crafted features. Therefore, we establish guidelines for improving existing deep IR models. Furthermore, we compare two different categories of deep IR models, i.e. representation-focused models and interaction-focused models. It is shown that two types of deep IR models focus on different categories of words, including topic-related words and query-related words. Copyright © 2017, The Authors. All rights reserved.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：