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

Personalized Review Recommendation based on Implicit dimension mining

Personalized Review Recommendation based on Implicit dimensi...

2024 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, NAACL 2024

作者： Xu, Bei Xu, Yifan School of Computer Science Nanjing University of Posts and Telecommunications Nanjing210023 China Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing210023 China

Users usually browse product reviews before buying products from e-commerce websites. Lots of e-commerce websites can recommend reviews. However, existing research on review recommendation mainly focuses on the general usefulness of reviews and ignores personalized and implicit requirements. To address the issue, we propose a Large language model driven Personalized Review Recommendation model based on Implicit dimension mining (PRR-LI). The model mines implicit dimensions from reviews and requirements, and encodes them in the form of "text + dimension". The experiments show that our model significantly outperforms other state-of-the-art textual models on the Amazon-MRHP dataset, with some of the metrics outperforming the state-of-the-art multimodal models. And we prove that encoding "text + dimension" is better than encoding "text" and "dimension" separately in review recommendation. © 2024 Association for Computational Linguistics.

关键词： Signal encoding

来源：评论

学校读者我要写书评

暂无评论

Multi-source Infection Pattern Mining Algorithms over Moving Objects 25

Multi-source Infection Pattern Mining Algorithms over Moving...

引用

25th IEEE International Conference on computer Supported Cooperative Work in Design, CSCWD 2022

作者： Chen, Yu Dai, Hua Yang, Geng Chen, Yanli Nanjing University of Posts and Telecommunications School of Computer Science Nanjing210003 China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing210003 China

ISBN: (纸本)9781665405270

Using the trajectory data of moving objects to analyze and study the infection mode of viruses or germs has practical application value. The definition of infection pattern in existing works only considers one-to-one infection mode rather than many-to-one mode, and thus some infection events could be ignored. This paper presents multi-source infection pattern mining algorithms oriented to moving objects for the first time. The multi-source infection event (MSIE) is defined. On the basis of MSIE, the multi-source infection pattern mining algorithm (MIPM) is proposed, which uses sliding window mechanism. The sliding window is used to record the set of candidate infection source that may infect each normal object at each time point, and then the determined infection events are mined. To improve performance, an optimized mining algorithm (MIPM+) based on the R-tree index is proposed, which can reduce the number of objects to be detected at each time point. The experimental results show that our proposed multi-source infection pattern mining algorithms can mine more potential infection events. © 2022 IEEE.

关键词： Decision trees

来源：评论

学校读者我要写书评

暂无评论

Distributed Image Retrieval Base on LSH Indexing on Spark 1st

Distributed Image Retrieval Base on LSH Indexing on Spark

引用

1st International Conference on big data and security, ICBDS 2019

作者： Hou, Zelei Huang, Chao Wu, Jiagao Liu, Linfeng School of Computer Nanjing University of Posts and Telecommunications NanjingJiangsu210023 China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing NanjingJiangsu210023 China

ISBN: (纸本)9789811575297

With the advent of the era of big data, how to process massive image, video and other multimedia data timely and accurately has become a new challenge in related fields. Aiming at the computational bottleneck and inefficiency of traditional image content retrieval system, in this paper, a distributed image retrieval framework base on Location Sensitive Hash (LSH) indexing is proposed on Spark, which combines with the distributed storage and computing characteristics of Spark big data platform. Then, distributed K-means based Bag of Visual Word (BoVW) algorithm and LSH algorithm are proposed to build LSH index vectors on Spark in parallel. The experiment shows that the retrieval time of our framework can be reduced significantly, and both retrieval recall and precision are high compared with the traditional retrieval method. © 2020, Springer Nature Singapore Pte Ltd.

关键词： Indexing (of information)

来源：评论

学校读者我要写书评

暂无评论

Customized scheduling for shared bus with deadlines

Customized scheduling for shared bus with deadlines

引用

作者： Jin, Yong Xu, Jia Xu, Lijie Liu, Linfeng Xiao, Fu Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Jiangsu Nanjing China School of Computer Science & Engineering Changshu Institute of Technology Jiangsu Changshu China

Public transportation system is one of the most effective ways to conserve energy and reduce carbon emissions. However, the traditional public transportation system does not provide customized service and cannot guarantee the arrival time to destination. To address these issues, we formulate the minimum shared bus scheduling problem to minimize the number of shared buses such that all orders can be completed under constraints of deadlines and capacity of shared bus. We propose the approximation algorithms, S-MBSA for the shared bus with strong endurance and E-MBSA for the large-scale order scenario, to solve the minimum shared bus scheduling problem. We further formulate the constrained maximum revenue shared bus scheduling problem to maximize the revenue under the limited number of shared buses, and propose an approximation algorithm, CMRBSA, to find the shared bus route schedules. Through the extensive simulations, we demonstrate the significant superiority of S-MBSA and E-MBSA in terms of number of shared buses. Furthermore, CMRBSA outperforms the benchmark algorithms significantly in terms of revenue. © 2022 John Wiley & Sons Ltd.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Discrimination-Aware Domain Adversarial Neural Network

引用

Journal of computer science & Technology 2020年第2期35卷 259-267页

作者： Yun-Yun Wang Jian-Min Gu Chao Wang Song-Can Chen Hui Xue College of Computer Science and Engineering Nanjing University of Posts and Telecommunications Nanjing 210046China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing 210046China College of Computer Science and Technology/College of Artificial Intelligence Nanjing University of Aeronautics and AstronauticsNanjing 210023China Key Laboratory of Pattern Analysis and Machine Intelligence Ministry of Industry and Information Technology Nanjing 210023China School of Computer Science and Engineering Southeast UniversityNanjing 210096China

The domain adversarial neural network(DANN)methods have been successfully proposed and attracted much attention *** DANNs,a discriminator is trained to discriminate the domain labels of features generated by a generator,whereas the generator attempts to confuse it such that the distributions between domains are *** a result,it actually encourages the whole alignment or transfer between domains,while the inter-class discriminative information across domains is not *** this paper,we present a Discrimination-Aware Domain Adversarial Neural Network(DA2NN)method to introduce the discriminative information or the discrepancy of inter-class instances across domains into deep domain ***2NN considers both the alignment within the same class and the separation among different classes across domains in knowledge transfer via multiple *** results show that DA2NN can achieve better classification performance compared with the DANN methods.

关键词： adversarial learning inter-class separation deep neural network discrimination-aware domain adaptation

来源：评论

学校读者我要写书评

暂无评论

Software Defect Prediction via Deep Belief Network

引用

Chinese Journal of Electronics 2019年第5期28卷 925-932页

作者： WEI Hua SHAN Chun HU Changzhen ZHANG Yu YU Xiao School of Computer Science and Technology Beijing Institute of Technology China Information Technology Security Evaluation Center Beijing Key Laboratory of Software Security Engineering Technology Beijing Institute of Technology School of Electrical and Information Engineering and Beijing Key Laboratory of Intelligent Processing for Building Big Data Beijing University of Civil Engineering and Architecture State Key Laboratory in China for Geomechanics and Deep Underground Engineering (Beijing) China University of Mining and Technology School of Computer Science and Technology Shandong University of Technology

Defect distribution prediction is a meaningful topic because software defects are the fundamental cause of many attacks and data loss. Building accurate prediction models can help developers find bugs and prioritize their testing efforts. Previous researches focus on exploring different machine learning algorithms based on the features that encode the characteristics of *** problem of data redundancy exists in software defect data set, which has great influence on prediction *** propose a defect distribution prediction model(Deep belief network prediction model, DBNPM), a system for detecting whether a program module contains defects. The key insight of DBNPM is Deep belief network(DBN)technology, which is an effective deep learning technique in image processing and natural language processing,whose features are similar to defects in source *** results show that DBNPM can efficiently extract and process the data characteristics of source program and the performance is better than Support vector machine(SVM), Locally linear embedding SVM(LLE-SVM), and Neighborhood preserving embedding SVM(NPE-SVM).

关键词： Defect prediction Software security Deep belief network(DBN)

来源：评论

学校读者我要写书评

暂无评论

Community-based message forwarding in mobile social networks

Community-based message forwarding in mobile social networks

引用

2019 International Conference on Advances in computer Technology, Information science and Communications, CTISC 2019

作者： Chen, Zhiming Xiang, Yang School of Computer Nanjing University of Posts and Telecommunications Nanjing210023 China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing210023 China

ISBN: (纸本)9789897583575

With the popularity of various smart devices and the application of sensor network technology, message transmission using mobile devices is becoming widespread. This paper focuses on the forwarding in mobile social network (MSN). The MSN is a special Delay Tolerant Network (DTN) consisting of mobile nodes. In MSN, nodes move and share information with each other through carried short-range wireless communication devices. Mobile nodes in the MSN typically access some building areas more frequently, such as schools, companies, or apartments, while visiting other areas, such as the roads between buildings, less frequently. The building areas that nodes frequently visit are called communities. To increase delivery ratio and reduce transmission time in MSN, this paper proposes a novel zero-knowledge multi-copy routing algorithm, Mixed Message Forwarding (MMF) which exploits and improves the metric, namely centrality. Centrality reflects the importance of a node in the network. MMF improves copy diffusion by using different directions of node movement as well. Special facilities called boundary boxes are added to the network scenario. Boundary boxes are special throw boxes. Throw boxes are relays with large storage space and fixed position. MMF is designed and evaluated, which utilizes the aforementioned boundary boxes to reduce transmission delay. The simulation results show that the MMF can improve the delivery ratio and reduce the transmission delay, compared with other algorithms. © 2019 by SCITEPRESS - science and Technology Publications, Lda.

关键词： Delay tolerant networks

来源：评论

学校读者我要写书评

暂无评论

Point Cloud Compression Method Based on Curvature Grading and Inter-point Compression for Industrial Products 15

Point Cloud Compression Method Based on Curvature Grading an...

引用

15th International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, CyberC 2023

作者： Wang, Lei Huang, Wei Chen, Yiping Chen, Ran Nanjing University of Posts and Telecommunications School of Computer Nanjing210023 China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing210023 China

ISBN: (纸本)9798350308693

The traditional point cloud compression methods fail to meet the compression requirements of complex surface point cloud files in the industrial field. This paper proposes a point cloud compression method suitable for industrial products with defective and complex surfaces, which compresses the defect and non-defect parts separately using different compression approaches. A curvature-based compression method is designed for the defect points, and an inter-point compression method is developed for the non-defect part, achieving compression of both components of the point cloud. The experimental results show the advantages of the proposed compression method through a comparative analysis of time efficiency, compression ratio, and reconstruction accuracy for industrial point cloud compression. © 2023 IEEE.

关键词： Grading

来源：评论

学校读者我要写书评

暂无评论

Learning Disentangled Latent Factors for Individual Treatment Effect Estimation Using Variational Generative Adversarial Nets 25

Learning Disentangled Latent Factors for Individual Treatmen...

引用

25th IEEE International Conference on computer Supported Cooperative Work in Design, CSCWD 2022

作者： Bao, Qingsen Mao, Zeyong Chen, Lei Nanjing University of Posts and Telecommunications School of Computer Science Nanjing China Nanjing University of Posts and Telecommunications Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing China

ISBN: (纸本)9781665405270

Estimating individual treatment effect (ITE) is a challenging task due to the need for individual potential outcomes to be learned from biased data and counterfactuals are inherently unobservable. Some researchers propose to use generative adversarial approaches to infer the counterfactual outcomes based on the distribution of factual outcomes. However, these methods assume that complete confounding factors are observed, and simply treat all observed variables as confounding factors, ignoring identification of possible instrumental factors and adjustment factors, which will bring large deviation to ITE estimation when facing biased data. To address these issues, we propose a novel Variational Generative Adversarial Nets for ITE estimation by designing the collaborative learning strategy with Variational AutoEncoder (VAE) and Generative Adversarial Nets (GAN). Specifically, we employ VAE to infer the latent representations of observed variables to access complete latent factors while using GAN to infer unseen counterfactual outcomes and guide VAE for disentangling these latent factors into three sets corresponding to the instrumental, confounding, and adjustment factors. Then the disentangled latent confounding factors can be used to further control data bias using an adaptive weighting scheme. Extensive experiments on real and synthetic data demonstrate learning disentangled latent factors for ITE estimation is effective, and our method has excellent performance even with high data bias. © 2022 IEEE.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

An adaptive flow table adjustment algorithm for SDN 21

An adaptive flow table adjustment algorithm for SDN

引用

21st IEEE International Conference on High Performance Computing and Communications, 17th IEEE International Conference on Smart City and 5th IEEE International Conference on data science and Systems, HPCC/SmartCity/DSS 2019

作者： Xu, Xiaolong Hu, Liuyun Lin, Haowei Fan, Zexuan School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China Jiangsu Key Laboratory of Big Data Security Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

ISBN: (纸本)9781728120584

SDN (Software-defined networking) are important for current network systems, such as cloud systems. The characteristics of flow in SDN and the impact of flow table entries and controllers on data packet transmission are analyzed. We propose an adaptive flow table adjustment algorithm for SDN called CFC (Combine flow table and controller). It is important for CFC to monitor the network traffic in real time. According to the proportion of active flow entries in the OpenFlow switch, the value of idle-timeout will be set dynamically based on the characteristics of different data flows. When the switch forwards packets, it will minimize the calculation load of controller, and allocate a reasonable value of idle-timeout to the idle flow table entries. So it can delete discarded flow table entries in time and improve the hit rate of data packets. The experiments show that the utilization rate of the flow table resource is enhanced. With the improvement of data packets' forwarding rate, the average throughput of the network has also increased. At the same time, it can also cope with the burst traffic in SDN and ensure them to be forwarded normally and effectively. © 2019 IEEE.

关键词： Controllers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：