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

Deep Sentiment Learning Network for Temporal-aware Recommendation Based on User Reviews

学校读者我要写书评

暂无评论

Deep Sentiment Learning Network for Temporal-aware Recommend...

IEEE International Conference on big data Analysis (ICBDA)

作者： xinxin Li Tianqi Shang Dezhong Peng xiaoyu Shi School of Information and Software Engineering University of Electronic Science and Technology of China Chengdu China College of Computer Science Sichuan University Chengdu China Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent Technology Chinese Academy of Sciences Chongqing China

Recently, many websites encourage users to fill in reviews on items and services to improve the quality of personalized recommendation, because of the rich sentiment information hidden in user reviews. However, most existing recommendation methods based on reviews heavily emphasize extracting the rich sentiment information from reviews by using deep learning technologies as far as possible and always ignore the effects of temporal dynamical of user preferences. To address the above issues, we propose DSL- TR, a deep sentiment learning framework for the temporal-aware recommendation, using an intricate combination of bidirectional long short-term memory (BLSTM) and Convolution Neural Network (CNN). It consists of four layers: embedding layer, BLSTM layer, CNN layer and feature fusion layer. In the embedding layer, we explicitly combine the time information in the review embedding layer by regarding the review time as an independent factor. Then, we utilize the BLSTM and CNN networks to extract the long and short-terms of latent features of user and item in parallel. Finally, the factorization machine technique, as a rating predictor, is introduced on the last layer to estimate the rating based on the learned user and item latent features. We conduct extensive experiments on Amazon's four data sets. The results demonstrate that our proposed method outperforms several state-of-art methods consistently.

关键词： Deep learning Convolution Conferences Neural networks big data Feature extraction data mining

Graph Regularized Nonnegative Latent Factor Analysis Model for Temporal Link Prediction in Cryptocurrency Transaction Networks

学校读者我要写书评

暂无评论

Graph Regularized Nonnegative Latent Factor Analysis Model f...

IEEE International Conference on Networking, Sensing and Control

作者： Yue Zhou ZhiGang Liu Ye Yuan School of Computer Science and Technology Choncgqing University of Posts and Telecommunications Chongqing China School of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent Technology Chinese Academy of Sciences Chongqing 400714 China and with the Chongqing School University of Chinese Academy of Sciences Chongqing China College of Computer and Information Science Southwest University Chongqing China

ISBN: (纸本)9781665472449

With the development of blockchain technology, a cryptocurrency based on blockchain technology is becoming more and more popular. The huge cryptocurrency transaction network has therefore received widespread attention. The link prediction learning structure of the network is supportive to understand the mechanism of networks, so it also has been widely studied in the cryptocurrency network. However, the dynamics of cryptocurrency transaction networks have been neglected in past studies. In this study, therefore, we use a graph-regularized method to link past transaction records with future transactions. Based on this, we propose a single latent factor-dependent, nonnegative, multiplicative, and graph regularized-incorporated update (SLF-NMGRU) algorithm and further propose a graph regularized nonnegative latent factor analysis (GrNLFA) model. Eventually, the experimental results on a real cryptocurrency transaction network show that the proposed method improves both the accuracy and computational efficiency.

关键词： Analytical models Tensors Computational modeling Heuristic algorithms Optimization methods Predictive models Prediction algorithms

The Minority Matters: A Diversity-Promoting Collaborative Metric Learning Algorithm

学校读者我要写书评

暂无评论

arxiv 2022年

作者： Bao, Shilong Xu, Qianqian Yang, Zhiyong He, Yuan Cao, xiaochun Huang, Qingming State Key Laboratory of Information Security Institute of Information Engineering CAS China School of Cyber Security University of Chinese Academy of Sciences China Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS China School of Computer Science and Tech. University of Chinese Academy of Sciences China Alibaba Group China School of Cyber Science and Technology Shenzhen Campus Sun Yat-sen University China Key Laboratory of Big Data Mining and Knowledge Management CAS China Peng Cheng Laboratory China

Collaborative Metric Learning (CML) has recently emerged as a popular method in recommendation systems (RS), closing the gap between metric learning and Collaborative Filtering. Following the convention of RS, existing methods exploit unique user representation in their model design. This paper focuses on a challenging scenario where a user has multiple categories of interests. Under this setting, we argue that the unique user representation might induce preference bias, especially when the item category distribution is imbalanced. To address this issue, we propose a novel method called Diversity-Promoting Collaborative Metric Learning (DPCML), with the hope of considering the commonly ignored minority interest of the user. The key idea behind DPCML is to include a multiple set of representations for each user in the system. Based on this embedding paradigm, user preference toward an item is aggregated from different embeddings by taking the minimum item-user distance among the user embedding set. Furthermore, we observe that the diversity of the embeddings for the same user also plays an essential role in the model. To this end, we propose a diversity control regularization term to accommodate the multi-vector representation strategy better. Theoretically, we show that DPCML could generalize well to unseen test data by tackling the challenge of the annoying operation that comes from the minimum value. Experiments over a range of benchmark datasets speak to the efficacy of DPCML. © 2022, CC BY-NC-SA.

关键词： Embeddings

UEIN: A User Evolving Interests Network for Click-Through Rate Prediction

学校读者我要写书评

暂无评论

UEIN: A User Evolving Interests Network for Click-Through Ra...

big data Science and Engineering (bigdataSE), IEEE International Conference on

作者： Jianxiong Xu xiaoyu Shi Hezhe Qiao Mingsheng Shang xianbo He Qingyu He The Computer School of China West Normal University Nanchong Sichuan China Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent Technology Chinese Academy of Sciences Chongqing China College of Land and Resources China West Normal University Nanchong Sichuan China

ISBN: (纸本)9781665400398

The Click-Through Rate (CTR) prediction via modeling the change of user interest is of great significance task to industrial applications. Most of the existing methods based on collaborative filtering (CF) and recurrent neural network (RNN) that focus on capturing user's long-term and short-term interests separately, or combine these interests in a tough way. However, the effect of long- and short-term interests accounts different ratios to the next-item decision of user, rather than equally. To address this issue, we propose UEIN, a novel User Evolving Interest Network for CTR prediction task, that can capture the change of user preference via adaptively fusion the user's long-term and short-term interests over time. To explicitly learn the user preference on item category, we add the item category information into user behavior sequence, by clustering the items into different categories. Then we divide user historical behaviors into two sequence parts, long-term and short-term behaviors sequence. Based on this, we leverage the attention network to learn the user's current interest from the short-term behaviors sequence, while a dense network is adopted to extract the user's general interest from the long-term sequence. After that, an adaptive fusion mechanism is proposed to combine the current and general interest adaptively, and the prediction result is generated based on the user's combined interest. Extensive experimental results on industrial datasets demonstrated that the superiority of our proposed model, compared to the state-of-the-art models.

关键词： Adaptation models Recurrent neural networks Conferences Collaborative filtering Clustering methods Predictive models Feature extraction

Group-wise Inhibition based Feature Regularization for Robust Classification

学校读者我要写书评

暂无评论

Group-wise Inhibition based Feature Regularization for Robus...

International Conference on Computer Vision (ICCV)

作者： Haozhe Liu Haoqian Wu Weicheng xie Feng Liu Linlin Shen Computer Vision Institute College of Computer Science and Software Engineering SZU Branch Shenzhen Institute of Artificial Intelligence and Robotics for Society National Engineering Laboratory for Big Data System Computing Technology Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen China

The convolutional neural network (CNN) is vulnerable to degraded images with even very small variations (e.g. corrupted and adversarial samples). One of the possible reasons is that CNN pays more attention to the most discriminative regions, but ignores the auxiliary features when learning, leading to the lack of feature diversity for final judgment. In our method, we propose to dynamically suppress significant activation values of CNN by group-wise inhibition, but not fixedly or randomly handle them when training. The feature maps with different activation distribution are then processed separately to take the feature independence into account. CNN is finally guided to learn richer discriminative features hierarchically for robust classification according to the proposed regularization. Our method is comprehensively evaluated under multiple settings, including classification against corruptions, adversarial attacks and low data regime. Extensive experimental results show that the proposed method can achieve significant improvements in terms of both robustness and generalization performances, when compared with the state-of-the-art methods. Code is available at https://***/LinusWu/TENET_Training.

关键词： Training Computer vision Codes Heuristic algorithms Robustness Classification algorithms Convolutional neural networks

Dual-View Pyramid Pooling in Deep Neural Networks for Improved Medical Image Classification and Confidence Calibration

学校读者我要写书评

暂无评论

arxiv 2024年

作者： Zhang, xiaoqing Nie, Qiushi xiao, Zunjie Zhao, Jilu Wu, xiao Guo, Pengxin Li, Runzhi Liu, Jin Wei, Yanjie Pan, Yi Center for High Performance Computing Shenzhen Key Laboratory of Intelligent Bioinformatics Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Guangdong Shenzhen518055 China Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen518055 China Department of Statistics and Actuarial Science The University of Hong Kong 999077 Hong Kong Cooperative Innovation Center of Internet Healthcare Zhengzhou University Zhengzhou450001 China Hunan Provincial Key Lab on Bioinformatics School of Computer Science and Engineering Central South University Changsha410083 China Xinjiang Engineering Research Center of Big Data and Intelligent Software School of software Xinjiang University Wulumuqi830046 China Faculty of Computer Science and Control Engineering Shenzhen University of Advanced Technology Shenzhen China

Spatial pooling (SP) and cross-channel pooling (CCP) operators have been applied to aggregate spatial features and pixel-wise features from feature maps in deep neural networks (DNNs), respectively. Their main goal is to reduce computation and memory overhead without visibly weakening the performance of DNNs. However, SP often faces the problem of losing the subtle feature representations, while CCP has a high possibility of ignoring salient feature representations, which may lead to both miscalibration of confidence issues and suboptimal medical classification results. To address these problems, we propose a novel dual-view framework, the first to systematically investigate the relative roles of SP and CCP by analyzing the difference between spatial features and pixel-wise features. Based on this framework, we propose a new pooling method, termed dual-view pyramid pooling (DVPP), to aggregate multi-scale dual-view features. DVPP aims to boost both medical image classification and confidence calibration performance by fully leveraging the merits of SP and CCP operators from a dual-axis perspective. Additionally, we discuss how to fulfill DVPP with five parameter-free implementations. Extensive experiments on six 2D/3D medical image classification tasks show that our DVPP surpasses state-of-the-art pooling methods in terms of medical image classification results and confidence calibration across different DNNs. © 2024, CC BY.

关键词： Deep neural networks

TSAR-based Expert Recommendation Mechanism for Community Question Answering

学校读者我要写书评

暂无评论

TSAR-based Expert Recommendation Mechanism for Community Que...

International Conference on Computer Supported Cooperative Work in Design

作者： Jian Song xiaolong Xu xinheng Wang Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China School of Computing and Engineering University of West London London UK

ISBN: (纸本)9781728165974;9781728165981

Community Question Answering (CQA) provides a platform to share knowledge for users. With the increasing number of users and questions, askers have to wait a long time for an answer with high quality while responders may not be interested in assigned questions. Current methods usually try to address this issue based on text or link analysis. However, most of them suffer from delayed answers or low coverage of best answer. In this paper, we design a novel expert recommendation mechanism by incorporating the deep structured semantic model (DSSM) [20] with our proposed graph-based algorithm, a topic sensitive answerer rank algorithm (TSAR). In the process of constructing transition probability matrix, we not only take into account both the number of questions answered by the user and question difficulty, but also consider the user's average response time for providing the answer. The experiments carried out on Yahoo! Answers and Stack Overflow datasets demonstrate that the proposed mechanism outperforms the current typical algorithms [9] on multiple metrics and achieves the best answer coverages, which are 61.5% and 53.8%, respectively.

关键词： Measurement Conferences Semantics Knowledge discovery Collaborative work Time factors

A Tent Lévy Flying Sparrow Search Algorithm for Feature Selection: A COVID-19 Case Study

学校读者我要写书评

暂无评论

arxiv 2022年

作者： Yang, Qinwen Gao, Yuelin Song, Yanjie School of Computer Science and Engineering North Minzu University Yinchuan750021 China School of Mathematics and Information Science North Minzu University Yinchuan750021 China Ningxia Key Laboratory of Intelligent Information and Big Data Processing Yinchuan750021 China Ningxia Province Cooperative Innovation Center of Scientific Computing and Intelligent in Formation Processing North Minzu University Yinchuan750021 China College of Systems Engineering National University of Defense Technology Changsha410073 China

The "Curse of Dimensionality" induced by the rapid development of information science, might have a negative impact when dealing with big datasets. In this paper, we propose a variant of the sparrow search algorithm (SSA), called Tent Lévy flying sparrow search algorithm (TFSSA), and use it to select the best subset of features in the packing pattern for classification purposes. SSA is a recently proposed algorithm that has not been systematically applied to feature selection problems. After verification by the CEC2020 benchmark function, TFSSA is used to select the best feature combination to maximize classification accuracy and minimize the number of selected features. The proposed TFSSA is compared with nine algorithms in the literature. Nine evaluation metrics are used to properly evaluate and compare the performance of these algorithms on twenty-one datasets from the UCI repository. Furthermore, the approach is applied to the coronavirus disease (COVID-19) dataset, yielding the best average classification accuracy and the average number of feature selections, respectively, of 93.47% and 2.1. Experimental results confirm the advantages of the proposed algorithm in improving classification accuracy and reducing the number of selected features compared to other wrapper-based algorithms. Copyright © 2022, The Authors. All rights reserved.

关键词： COVID-19

Progressive Dual Priori Network for Generalized Breast Tumor Segmentation

学校读者我要写书评

暂无评论

arxiv 2023年

作者： Wang, Li Wang, Lihui Kuai, Zixiang Tang, Lei Ou, Yingfeng Ye, Chen Zhu, Yuemin Wu, Min Shi, Tianliang Engineering Research Center of Text Computing & Cognitive Intelligence Ministry of Education Key Laboratory of Intelligent Medical Image Analysis and Precise Diagnosis of Guizhou Province State Key Laboratory of Public Big Data College of Computer Science and Technology Guizhou University Guiyang550025 China Imaging Center Harbin Medical University Cancer Hospital Harbin150081 China Radiology Department Guizhou Provincial People’s Hospital Guiyang550002 China Radiology Department Tongren People’s Hospital Tongren554300 China Univ Lyon INSA Lyon CNRS Inserm CREATIS UMR 5220 U1206 LyonF-69621 France

To promote the generalization ability of breast tumor segmentation models, as well as to improve the segmentation performance for breast tumors with smaller size, low-contrast and irregular shape, we propose a progressive dual priori network (PDPNet) to segment breast tumors from dynamic enhanced magnetic resonance images (DCE-MRI) acquired at different centers. The PDPNet first cropped tumor regions with a coarse-segmentation based localization module, then the breast tumor mask was progressively refined by using the weak semantic priori and cross-scale correlation prior knowledge. To validate the effectiveness of PDPNet, we compared it with several state-of-the-art methods on multi-center datasets. The results showed that, comparing against the suboptimal method, the DSC and HD95 of PDPNet were improved at least by 5.13% and 7.58% respectively on multi-center test sets. In addition, through ablations, we demonstrated that the proposed localization module can decrease the influence of normal tissues and therefore improve the generalization ability of the model. The weak semantic priors allow focusing on tumor regions to avoid missing small tumors and low-contrast tumors. The cross-scale correlation priors are beneficial for promoting the shape-aware ability for irregular tumors. Thus integrating them in a unified framework improved the multicenter breast tumor segmentation performance. The source code and open data can be accessed at https://github. com/wangli100209/PDPNet. Copyright © 2023, The Authors. All rights reserved.

关键词： Magnetic resonance