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

IEEE International Conference on Systems, Man and Cybernetics

作者： Baojie Xu Zhenyu Yang Yan Huang Wenyue Hu Zhibo Zhang The Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9781665410205

ISBN: (纸本)9781665410212

Personalized News Recommendation (PNR) can enhance user experience by alleviating information overload. Traditional news recommendation methods consider all clicking behaviors as user interests, resulting in biased user modeling that fails to accurately capture user interests. In addition, although there are methods to reduce the impact of low-quality news at the representation level by simply filtering it through the attention mechanism. However, this only implicitly models the news in the interaction sequence without specifically considering the quality of each news, and thus has very limited effect in identifying noise. To address these issues, this paper proposes News Recommendation method based on News Quality-aware modeling (NQNR). We attempt to explicitly model the news in the click sequence and candidate ranking one by one to visually assess the quality of each news. Specifically, we design a detection module to detect whether the input news is low-quality news. Then, by reducing the influence of low-quality news in user modeling and candidate ranking, user interests are modeled more accurately, while recommendations of such news are reduced for users. In addition, to capture the similarity of vectors more accurately, we also design a similarity computation method based on the multiple attention mechanism in the detection module. Experiments on a large real-world Microsoft News dataset (MIND) show that our model significantly outperforms previous models. Our code is posted at the following URL: https://***/xxbbjj/NQNR-.

关键词： Uniform resource locators Attention mechanisms Codes Accuracy Filtering Computational modeling Noise Vectors User experience Cybernetics

来源：评论

学校读者我要写书评

暂无评论

ERC DMSP: Emotion Recognition in Conversation Based on Dynamic Modeling of Speaker Personalities

ERC DMSP: Emotion Recognition in Conversation Based on Dynam...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Xiaoyang Li Zhenyu Yang Zhijun Li Yiwen Li Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9798350359312

ISBN: (纸本)9798350359329

Emotion Recognition in Conversations (ERC) is a widely applicable task, whether in emotional chatbots or recommender systems for dialog scenarios. The ability of systems to accurately identify human emotions is a crucial component in ERC success. In everyday conversations, a speaker’s emotional expression is closely tied to their individual characteristics and personality traits. Furthermore, individuals exhibit significant variations in their expressions of the same emotion. Traditional methods for ERC often overlook these personality differences and dynamic changes, leading to unreliable results. To address this issue, we propose a conversation emotion recognition model based on dynamic modeling of speaker’s personality (ERC DMSP). In our approach, to extract a speaker’s personality profile, we design a personality capture module to model the personalities of individuals based on their historical utterances. Moreover, a bidirectional influence exists between a speaker’s personality tendencies and their linguistic behavior. The speaker’s personality profile is thus continually updated based on the ongoing dialog. Additionally, since the personalities of other speakers in the conversation can also affect the form and intensity of a speaker’s emotional expression, we construct a conversation emotion representation utilizing group personality traits. We then comprehensively incorporate the speaker’s personality into the emotion representation of each utterance at both the group and individual levels through the personality engagement module. Throughout this process, the representation of dialog and the speaker’s personality undergo hierarchical updates, leading to more accurate conversation emotion recognition. We conducted extensive experiments on four commonly used public benchmark datasets for ERC to evaluate the effectiveness of our proposed ERC DMSP model. The results demonstrate its efficacy, as it exhibits a significant improvement over other methods in popular

关键词： Measurement Emotion recognition Accuracy Codes Neural networks Oral communication Color

来源：评论

学校读者我要写书评

暂无评论

Human-in-the-loop: Provably Efficient Preference-based Reinforcement Learning with General Function Approximation

arXiv

引用

arXiv 2022年

作者： Chen, Xiaoyu Zhong, Han Yang, Zhuoran Wang, Zhaoran Wang, Liwei Key Laboratory of Machine Perception MOE School of Artificial Intelligence Peking University China Center for Data Science Peking University China Peng Cheng Laboratory China Department of Statistics and Data Science Yale University United States Department of Industrial Engineering and Management Sciences Northwestern University United States

We study human-in-the-loop reinforcement learning (RL) with trajectory preferences, where instead of receiving a numeric reward at each step, the agent only receives preferences over trajectory pairs from a human overseer. The goal of the agent is to learn the optimal policy which is most preferred by the human overseer. Despite the empirical successes, the theoretical understanding of preference-based RL (PbRL) is only limited to the tabular case. In this paper, we propose the first optimistic model-based algorithm for PbRL with general function approximation, which estimates the model using value-targeted regression and calculates the exploratory policies by solving an optimistic planning problem. Our_ algorithm achieves the regret of Õ(poly(dH)√K), where d is the complexity measure of the transition and preference model depending on the Eluder dimension and log-covering numbers, H is the planning horizon, K is the number of episodes, and Õ(·) omits logarithmic terms. Our lower bound indicates that our algorithm is near-optimal when specialized to the linear setting. Furthermore, we extend the PbRL problem by formulating a novel problem called RL with n-wise comparisons, and provide the first sample-efficient algorithm for this new setting. To the best of our knowledge, this is the first theoretical result for PbRL with (general) function approximation. Copyright © 2022, The Authors. All rights reserved.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

N-Doped Carbon-Stabilized Pdnicu Nanoparticles Derived from Pdni@Cu-Zif-8 as Highly Active and Durable Electrocatalyst for Boosting Ethanol Oxidation

SSRN

引用

SSRN 2023年

作者： Chen, Yizhe Yang, Jian Ma, Yanyun Tang, Junping Zhao, Xueling Chen, Cheng Wang, Lijun Zhang, Binwei Zhou, Xinwen Sun, Shigang Lin, Donghai School of Energy and Materials Shanghai Thermophysical Properties Big Data Professional Technical Service Platform Shanghai Engineering Research Center of Advanced Thermal Functional Materials Shanghai Key Laboratory of Engineering Materials Application and Evaluation Shanghai Polytechnic University Shanghai201209 China State Key Laboratory of Physical Chemistry of Solid Surfaces Department of Chemistry College of Chemistry and Chemical Engineering Xiamen University Xiamen361005 China Jiangsu Key Laboratory for Carbon-Based Functional Materials & Devices Soochow University Jiangsu Suzhou215123 China School of Chemistry and Chemical Engineering Chongqing University Chongqing401331 China Center of Advanced Energy Technology and Electrochemistry Institute of Advanced Interdisciplinary Studies Chongqing University Chongqing400044 China College of Biological and Pharmaceutical Sciences China Three Gorges University Yichang443002 China

Controlling the component, tailoring the size and designing the carbon supporting materials are three promising strategies to improve electrocatalytic activity. Herein, a monatomic Cu carrier (CuCN) with larger specific surface area was used to anchor PdNi alloy nanoparticles by a facile one-step reduction method. Physical characterization revealed that the PdNi nanoparticles in the synthesized material possess good dispersion, which is mainly attributed to the high specific surface area of CuCN-900. Electrochemical results revealed that CuCN supported PdNi nanoparticles (Pd1Ni1/CuCN-900) nanohybrids had superior durability and catalytic activity for the ethanol oxidation (EOR) compared with other PdxNiy/CuCN and commercial Pd/C. Meanwhile, the rotating disk electrode (RDE) results also further demonstrated that Pd1Ni1/CuCN-900 has a faster kinetic process of ethanol oxidation compared to commercial Pd/C. DFT calculation implies that OH adsorption is preferentially near the Ni atom, the OH species on Ni1Pd1 surface play an important role in the process of EOR. This is of great research implications for finding new carbon carriers and regulating catalyst components to improve the catalytic efficiency of PdNi catalysts. © 2023, The Authors. All rights reserved.

关键词： Nanoparticles

来源：评论

学校读者我要写书评

暂无评论

Semisupervised Encrypted Traffic Identification Based on Auxiliary Classification Generative Adversarial Network

引用

Computer Systems Science & engineering 2021年第12期39卷 373-390页

作者： Jiaming Mao Mingming Zhang Mu Chen Lu Chen Fei Xia Lei Fan ZiXuan Wang Wenbing Zhao State Grid Jiangsu Electric Power Co. Ltd.Information and Telecommunication BranchNanJing210003China Institute of Information and Communication Global Energy Interconnection Research InstituteState Grid Key Laboratory of Information and Network SecurityNanjing210003China Engineering Research Center of Post Big Data Technology and Application of Jiangsu Province Research and Development Center of Post Industry Technology of the State Posts Bureau(Internet of Things Technology)Broadband Wireless Communication Technology Engineering Research Center of the Ministry of EducationNanjing University of Posts and TelecommunicationsNanjing210003China Department of Electrical Engineering and Computer Science Cleveland State UniversityCleveland44115USA

The rapidly increasing popularity of mobile devices has changed the methods with which people access various network services and increased net-work traffic *** the past few decades,network traffic identification has been a research hotspot in the field of network management and security ***,as more network services use encryption technology,network traffic identification faces many *** classic machine learning methods can solve many problems that cannot be solved by port-and payload-based methods,manually extract features that are frequently updated is time-consuming and *** learning has good automatic feature learning capabilities and is an ideal method for network traffic identification,particularly encrypted traffic identification;Existing recognition methods based on deep learning primarily use supervised learning methods and rely on many labeled ***,in real scenarios,labeled samples are often difficult to *** paper adjusts the structure of the auxiliary classification generation adversarial network(ACGAN)so that it can use unlabeled samples for training,and use the wasserstein distance instead of the original cross entropy as the loss function to achieve semisupervised *** results show that the identification accuracy of ISCX and USTC data sets using the proposed method yields markedly better performance when the number of labeled samples is small compared to that of convolutional neural network(CNN)based classifier.

关键词： Encrypted traffic recognition deep learning generative adversarial network traffic classification semisupervised learning

来源：评论

学校读者我要写书评

暂无评论

Short-term Portfolio Optimization using Doubly Regularized Exponential Growth Rate

Short-term Portfolio Optimization using Doubly Regularized E...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Quanlong Guan Jinneng He Zhao-Rong Lai Yuyu Zhou Quming Jiang Ziliang Chen College of Information Science and Technology Jinan University Guangzhou China Guangdong Institute of Smart Education Jinan University Guangzhou China Guangdong Key Laboratory of Data Security and Privacy Preserving Guangzhou China Guangdong-Macao Advanced Intelligent Computing Joint Laboratory Zhuhai China Chutian Dragon Co. Ltd Dongguan China School of Intelligent Systems Science and Engineering Jinan University China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

In the realm of short-term portfolio optimization, the integration of machine learning with exponential growth rate techniques is gaining prominence. This paper introduces a novel approach for short-term portfolio optimization, termed Short-term Portfolio Optimization using Doubly Regularized EGR (SPODR), to address the challenges posed by limited data availability. SPODR utilizes radial basis functions for the effective identification of market trends, enabling improved stock market forecasts. The approach uniquely combines ℓ 1 and ℓ 2 -regularization, adhering to empirical financial principles, to strike a balance between risk and return in short-term portfolios. A key aspect of SPODR is addressing the complexity of its ElasticNet-like objective, which poses a challenge for traditional methods due to its online learning nature. To overcome this, we have developed an algorithm based on the log barrier interior-point method. This algorithm is adept at efficiently optimizing portfolio allocation, taking into account the specific constraints inherent in our approach. Extensive comparative experiments across five benchmark datasets demonstrate that SPODR significantly outperforms existing short-term portfolio optimization models. It achieves a right balance between return and risk. Furthermore, SPODR showcases efficient computational speed, enhancing its applicability in real-world financial settings.

关键词： Computational modeling Benchmark testing Market research Robustness Regulation Computational efficiency Resource management

来源：评论

学校读者我要写书评

暂无评论

Randomized algorithms for computing the tensor train approximation and their applications

arXiv

引用

arXiv 2024年

作者： Che, Maolin Wei, Yimin Yan, Hong School of Mathematics and Statistics Guizhou University Guizhou Guiyang550025 China Center for Intelligent Multidimensional Data Analysis Hong Science Park Shatin Hong Kong School of Mathematical Sciences Key Laboratory of Mathematics for Nonlinear Sciences Fudan University Shanghai200433 China Department of Electrical Engineering Center for Intelligent Multidimensional Data Analysis City University of Hong Kong 83 Tat Chee Avenue Kowloon Hong Kong

In this paper, we focus on the fixed TT-rank and precision problems of finding an approximation of the tensor train (TT) decomposition of a tensor. Note that the TT-SVD and TT-cross are two well-known algorithms for these two problems. Firstly, by combining the random projection technique with the power scheme, we obtain two types of randomized algorithms for the fixed TT-rank problem. Secondly, by using the non-asymptotic theory of sub-random Gaussian matrices, we derive the upper bounds of the proposed randomized algorithms. Thirdly, we deduce a new deterministic strategy to estimate the desired TT-rank with a given tolerance and another adaptive randomized algorithm that finds a low TT-rank representation satisfying a given tolerance, and is beneficial when the target TT-rank is not known in advance. We finally illustrate the accuracy of the proposed algorithms via some test tensors from synthetic and real databases. In particular, for the fixed TT-rank problem, the proposed algorithms can be several times faster than the TT-SVD, and the accuracy of the proposed algorithms and the TT-SVD are comparable for several test *** Codes 15A18, 15A69, 65F55, 68W20 Copyright © 2024, The Authors. All rights reserved.

关键词： Tensors

来源：评论

学校读者我要写书评

暂无评论

Structural Entities Extraction and Patient Indications Incorporation for Chest X-ray Report Generation

arXiv

引用

arXiv 2024年

作者： Liu, Kang Ma, Zhuoqi Kang, Xiaolu Zhong, Zhusi Jiao, Zhicheng Baird, Grayson Bai, Harrison Miao, Qiguang School of Computer Science and Technology Xidian University Xi’an China Xi’an Key Laboratory of Big Data and Intelligent Vision Xi’an China Key Laboratory of Collaborative Intelligence Systems Ministry of Education Xidian University Xi’an China Warren Alpert Medical School Brown University Providence United States School of Electronic Engineering Xidian University Xi’an China Department of Radiology and Radiological Sciences Johns Hopkins University School of Medicine Baltimore United States

The automated generation of imaging reports proves invaluable in alleviating the workload of radiologists. A clinically applicable reports generation algorithm should demonstrate its effectiveness in producing reports that accurately describe radiology findings and attend to patient-specific indications. In this paper, we introduce a novel method, Structural Entities extraction and patient indications Incorporation (SEI) for chest X-ray report generation. Specifically, we employ a structural entities extraction (SEE) approach to eliminate presentation-style vocabulary in reports and improve the quality of factual entity sequences. This reduces the noise in the following cross-modal alignment module by aligning X-ray images with factual entity sequences in reports, thereby enhancing the precision of cross-modal alignment and further aiding the model in gradient-free retrieval of similar historical cases. Subsequently, we propose a cross-modal fusion network to integrate information from X-ray images, similar historical cases, and patient-specific indications. This process allows the text decoder to attend to discriminative features of X-ray images, assimilate historical diagnostic information from similar cases, and understand the examination intention of patients. This, in turn, assists in triggering the text decoder to produce high-quality reports. Experiments conducted on MIMIC-CXR validate the superiority of SEI over state-of-the-art approaches on both natural language generation and clinical efficacy metrics. Copyright © 2024, The Authors. All rights reserved.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

Quaternary Neural Network Equalization for Three-Dimentional Magnetic Recording

Quaternary Neural Network Equalization for Three-Dimentional...

引用

Magnetic Conference - Short Papers (INTERMAG Short Papers), IEEE International

作者： Ke Luo Yufei Wu Yanzhe Liao Shaobing Wang Yugen Jian Jincai Chen Ping Lu Wuhan National Laboratory for Optoelectronics Huazhong University of Science and Technology Wuhan China Key Laboratory of Information Storage System Engineering Research Center of Data Storage Systems and Technology Ministry of Education of China Huazhong University of Science and Technology Wuhan China School of Computer Science & Technology Huazhong University of Science and Technology Wuhan China School of Public Health Hubei University of Medicine Shiyan China

ISBN: (数字)9798350362213

ISBN: (纸本)9798350362220

One approach considered promising for advancing the development of magnetic data storage systems is three-dimensional magnetic recording. But when the recording density rises, media noise becomes a bigger problem for magnetic recording technology. Machine learning algorithms have been proven to outperform traditional numerical techniques in solving the magnetic recording signal quality issue. We compared the detection bit error rate (BER) performance of a per-layer shallow neural network equalizer and a quaternary neural network equalizer for two recording layers. For a two-layer recording density of 4 Tb/in 2 , the results show that the combined quaternary neural network equalization and detection scheme outperforms the per-layer shallow neural network equalization and one-dimensional Viterbi detection and outperforms the conventional two-dimensional generalized partial response equalizer combined with a quaternary Viterbi detector, especially for the bottom layer.

关键词： Machine learning algorithms Equalizers Viterbi algorithm Buffer storage Neural networks Bit error rate Noise

来源：评论

学校读者我要写书评

暂无评论

Robust Low-rank Deep Feature Recovery in CNNs: Toward Low Information Loss and Fast Convergence

Robust Low-rank Deep Feature Recovery in CNNs: Toward Low In...

引用

IEEE International Conference on data Mining (ICDM)

作者： Jiahuan Ren Zhao Zhang Jicong Fan Haijun Zhang Mingliang Xu Meng Wang School of Computer Science and Information Engineering Hefei University of Technology Hefei China Key Laboratory of Knowledge Engineering with Big Data (Ministry of Education) & Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei China School of Data Science The Chinese University of Hong Kong (Shenzhen) & Shenzhen Research Institute of Big Data Shenzhen China Harbin Institute of Technology (Shenzhen) Shenzhen China School of Information Engineering Zhengzhou University Zhengzhou China

ISBN: (纸本)9781665423991

Convolutional Neural Networks (CNNs)-guided deep models have obtained impressive performance for image representation, however the representation ability may still be restricted and usually needs more epochs to make the model converge in training, due to the useful information loss during the convolution and pooling operations. We therefore propose a general feature recovery layer, termed Low-rank Deep Feature Recovery (LDFR), to enhance the representation ability of the convolutional features by seamlessly integrating low-rank recovery into CNNs, which can be easily extended to all existing CNNs-based models. To be specific, to recover the lost information during the convolution operation, LDFR aims at learning the low-rank projections to embed the feature maps onto a low-rank subspace based on some selected informative convolutional feature maps. Such low-rank recovery operation can ensure all convolutional feature maps to be reconstructed easily to recover the underlying subspace with more useful and detailed information discovered, e.g., the strokes of characters or the texture information of clothes can be enhanced after LDFR. In addition, to make the learnt low-rank subspaces more powerful for feature recovery, we design a fusion strategy to obtain a generalized subspace, which averages over all learnt sub-spaces in each LDFR layer, so that the convolutional feature maps in test phase can be recovered effectively via low-rank embedding. Extensive results on several image datasets show that existing CNNs-based models equipped with our LDFR layer can obtain better performance.

关键词： Training Image recognition Convolution Conferences Image representation data mining Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：