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

4th International Conference on Sentiment Analysis and Deep Learning, ICSADL 2025

作者： Rajalakshmi, N.R. Sharmila, L. Prabu, S. Veeramakali, T. Arulkumaran, G. Chourasia, Pranshu Vel Tech Rangarajan Dr.Sagunthala R&d Institute of Science and Technology Department of Computer Science and Engineering Tamil Nadu India School of Computing Srm Institute of Science and Technology Department of Computing Technologies Kattankulathur Chennai India School of Computing Srm Institute of Science and Technology Department of Data Science and Business Systems Kattankulathur Chennai India School of Computing and Information Technology Reva University Karnataka Bangalore560064 India

ISBN: (纸本)9798331523923

The HVAC system, energy storage building, distributed power supply, and other equipment are integrated into the scheduling algorithm, which is aimed at reducing household electricity consumption. It is also assumed that users can provide energy to the grid according to their own conditions. Taking electricity cost and comfort level as optimization targets, a home energy optimization control model for the coordinated management of hybrid energy sources is built. A smart scheduling mechanism based on the improved adaptive particle swarm optimization approach is proposed in order to derive the best time intervals for electric appliances, necessary power for the control of the room temperature for every time frame, and power for charging and discharging of the storage battery at various moments. Simulation results show that through the incorporation of distributed photovoltaic power generation, backup storage by battery, and home energy optimization control, the system efficiently balances between user comfort and electricity consumption. This offers great technical support to the development of home energy management systems. By using time-of-use electricity price for energy acquisition and supply, the optimization control goal is minimizing both power use and cost as well as preserving comfort levels. The hybrid energy management's proposed home energy optimization control model uses an adaptive particle swarm optimization algorithm to find the optimal operation schedules of the electrical appliances, the required power for temperature control in a room, and the charge/discharge power level of the storage battery at each time interval. As per the optimization principle, the proposed dynamic programming algorithm converts the multi-stage problem into a sequence of single-stage problems and solves them separately. This method successfully resolves intricate problems that cannot be addressed through greedy algorithms or divide-and-conquer. In this research, management ac

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

引用

Joint 30th International Conference on Computational Linguistics and 14th International Conference on Language Resources and Evaluation, LREC-COLING 2024

作者： Yu, Erxin Li, Jing Xu, Chunpu Department of Computing The Hong Kong Polytechnic University Hong Kong Research Centre for Data Science & Artificial Intelligence Hong Kong

ISBN: (纸本)9782493814104

Social media platforms are daily exhibiting millions of events. To preliminarily predict the mainstream public reaction to these events, we study trendy response prediction to automatically generate top-liked user replies to social media events. While previous works focus on generating responses without factoring in popularity, we propose Popularity-Aligned Language Models (PopALM) to distinguish responses liked by a larger audience through reinforcement learning. Recognizing the noisy labels from user "likes", we tailor-make curriculum learning in proximal policy optimization (PPO) to help models capture the essential samples for easy-to-hard training. In experiments, we build a large-scale Weibo dataset for trendy response prediction, and its results show that PopALM can help boost the performance of advanced language models. © 2024 ELRA Language Resource Association: CC BY-NC 4.0.

关键词： Curricula

来源：评论

学校读者我要写书评

暂无评论

Implementation of CBDC System for the Customised Development of Finance Service System 5

Implementation of CBDC System for the Customised Development...

引用

5th IEEE International Conference on computing, Power, and Communication Technologies, IC2PCT 2024

作者： Mehra, Devansh Vamsi, A. Sri Kavin, Prabhu Srm Institute of Science and Technology School of Computing College of Engineering and Technology Faculty of Engineering and Technology Department of Data Science and Business Systems Chennai India

ISBN: (纸本)9798350383522

CBDC-as-a-problem looks like a mania of interest from central banks and financial institutions all over the world. It may describe CBDC technology and CBDC technology development, the positive aspects of CBDC and its future perspectives as follows: The CBDC is linked to the existing banking systems in the past which was based on the past findings of the blockchain, DLT, etc., that possessed the qualities the previous ones did not have - security, trust, and transparency. Innovation, design and CBDC safety that falls below this paper are discussed in this section below. The paper proceeds to show several paths that central banks are taking to CBDC development given the regulation and changing dynamic of the financial world. However, the studies do not end there;information on the potential of CBDC for financial stability, monetary policy formulation trajectories, transaction privacy, and the role of banks is included. Given that in field of finance the CBDCs are becoming more and more important, this research paper shall ensure to provide consistent background to policymakers, financial institutions and society at large on CBDC and its structural implications. This guarantees that everyone is in the know so it will be possible for them to come up with compliant plans and decisions informed by the knowledge in this changing landscape that simply does not stop evolving. © 2024 IEEE.

关键词： CBDC DLT

来源：评论

学校读者我要写书评

暂无评论

Unsupervised machine learning approach for tailoring educational content to individual student weaknesses

引用

High-Confidence computing 2024年第4期4卷 91-104页

作者： Shabab Intishar Rahman Shadman Ahmed Tasnim Akter Fariha Ammar Mohammad Muhammad Nayeem Mubasshirul Haque Sriram Chellappan Jannatun Noor Department of Computer Science and Engineering BRAC UniversityDhaka 1212Bangladesh Department of Computer Science and Engineering University of South FloridaFL 33620USA Computing for Sustainability and Social Good(C2SG)Research Group Department of Computer Science and EngineeringSchool of Data and SciencesBRAC UniversityDhaka 1212Bangladesh

By analyzing data gathered through Online Learning(OL)systems,data mining can be used to unearth hidden relationships between topics and trends in student ***,in this paper,we show how data mining techniques such as clustering and association rule algorithms can be used on historical data to develop a unique recommendation system *** our implementation,we utilize historical data to generate association rules specifically for student test marks below a threshold of 60%.By focusing on marks below this threshold,we aim to identify and establish associations based on the patterns of weakness observed in the past ***,we leverage K-means clustering to provide instructors with visual representations of the generated *** strategy aids instructors in better comprehending the information and associations produced by the *** clustering helps visualize and organize the data in a way that makes it easier for instructors to analyze and gain insights,enabling them to support the verification of the relationship between *** can be a useful tool to deliver better feedback to students as well as provide better insights to instructors when developing their *** paper further shows a prototype implementation of the above-mentioned concepts to gain opinions and insights about the usability and viability of the proposed system.

关键词： Recommendation system Clustering F-P growth Apriori Associative pattern E-learning sphere Online learning

来源：评论

学校读者我要写书评

暂无评论

OSFS-Vague: Online streaming feature selection algorithm based on vague set

引用

CAAI Transactions on Intelligence Technology 2024年第6期9卷 1451-1466页

作者： Jie Yang Zhijun Wang Guoyin Wang Yanmin Liu Yi He Di Wu School of Physics and Electronic Science Zunyi Normal UniversityZunyiChina Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and TelecommunicationsChongqingChina Department of Computer Science Old Dominion UniversityNorfolkVirginiaUSA College of Computer and Information Science Southwest UniversityChongqingChina

Online streaming feature selection(OSFS),as an online learning manner to handle streaming features,is critical in addressing high-dimensional *** real big data-related applications,the patterns and distributions of streaming features constantly change over time due to dynamic data generation ***,existing OSFS methods rely on presented and fixed hyperparameters,which undoubtedly lead to poor selection performance when encountering dynamic *** make up for the existing shortcomings,the authors propose a novel OSFS algorithm based on vague set,named *** main idea is to combine uncertainty and three-way decision theories to improve feature selection from the traditional dichotomous method to the trichotomous ***-Vague also improves the calculation method of correlation between features and ***,OSFS-Vague uses the distance correlation coefficient to classify streaming features into relevant features,weakly redundant features,and redundant ***,the relevant features and weakly redundant features are filtered for an optimal feature *** evaluate the proposed OSFS-Vague,extensive empirical experiments have been conducted on 11 *** results demonstrate that OSFS-Vague outperforms six state-of-the-art OSFS algorithms in terms of selection accuracy and computational efficiency.

关键词： feature selection online feature selection three-way decision vague set

来源：评论

学校读者我要写书评

暂无评论

A Survey on Evolutionary Computation Based Drug Discovery

引用

IEEE Transactions on Evolutionary Computation 2024年第3期29卷 1-1页

作者： Yu, Qiyuan Lin, Qiuzhen Ji, Junkai Zhou, Wei He, Shan Zhu, Zexuan Tan, Kay Chen College of Computer Science and Software Engineering Shenzhen University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China School of Computer Science University of Birmingham Bir-mingham UK Department of Computing The Hong Kong Poly-technic University Hong Kong Hong Kong

Drug discovery is an expensive and risky process. To combat the challenges in drug discovery, an increasing number of researchers and pharmaceutical companies recognize the benefits of utilizing computational techniques. Evolutionary computation (EC) offers promise as most drug discovery problems are essentially complex optimization problems beyond conventional optimization algorithms. EC methods have been widely applied to solve these complex optimization problems especially in lead com-pound generation and molecular virtual evaluation, substantially speeding up the process of drug discovery and development. This article presents a comprehensive survey of EC-based drug discovery methods. Particularly, a new taxonomy of the methods is provided and the advantages and limitations of the methods are reviewed. In addition, the potential future directions of EC-based drug discovery are discussed and the publicly available resources including databases and computational tools are compiled for the convenience of researchers seeking to pursue this field. IEEE

关键词： Lead compounds

来源：评论

学校读者我要写书评

暂无评论

Shrinkage Estimation for Location and Scale Parameters of Logistic Distribution Under Record Values

引用

Annals of data science 2024年第4期11卷 1209-1224页

作者： Gupta, Shubham Vishwakarma, Gajendra K. Elsawah, A.M. Department of Mathematics & amp Computing Indian Institute of Technology Dhanbad826004 India Department of Statistics and Data Science Faculty of Science and Technology Beijing Normal University-Hong Kong Baptist University United International College Zhuhai519087 China Guangdong Provincial Key Laboratory of Interdisciplinary Research and Application for Data Science BNU-HKBU United International College Zhuhai519087 China Department of Mathematics Faculty of Science Zagazig University Zagazig44519 Egypt

Logistic distribution (LogDis) is frequently used in many different applications, such as logistic regression, logit models, classification, neural networks, physical sciences, sports modeling, finance and health and disease studies. For instance, the distribution function of the LogDis has the same functional form as the derivative of the Fermi function that can be used to set the relative weight of various electron energies in their contributions to electron transport. The LogDis has wider tails than a normal distribution (NorDis), so it is more consistent with the underlying data and provides better insight into the likelihood of extreme events. For this reason the United States Chess Federation has switched its formula for calculating chess ratings from the NorDis to the LogDis. The outcomes of many real-life experiments are sequences of record-breaking data sets, where only observations that exceed (or only those that fall below) the current extreme value are recorded. The practice demonstrated that the widely used estimators of the scale and location parameters of logistic record values, such as the best linear unbiased estimators (BLUEs), have some defects. This paper investigates the shrinkage estimators of the location and scale parameters for logistic record values using prior information about their BLUEs. Theoretical and computational justifications for the accuracy and precision of the proposed shrinkage estimators are investigated via their bias and mean square error (MSE), which provide sufficient conditions for improving the proposed shrinkage estimators to get unbiased estimators with minimum MSE. The performance of the proposed shrinkage estimators is compared with the performances of the BLUEs. The results demonstrate that the resulting shrinkage estimators are shown to be remarkably efficient. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2023.

关键词： Mean square error

来源：评论

学校读者我要写书评

暂无评论

A Modified EACOP Implementation for Real-Parameter Single Objective Optimization Problems 13

A Modified EACOP Implementation for Real-Parameter Single Ob...

引用

13th IEEE Congress on Evolutionary Computation, CEC 2024

作者： Tangherloni, Andrea Coelho, Vasco Buffa, Francesca M. Cazzaniga, Paolo Bocconi Institute for Data Science and Analytics Bocconi University Department of Computing Sciences Milan Italy University of Milano-Bicocca Department of Informatics Systems and Communication Milan Italy Bocconi University Department of Computing Sciences Milan Italy Bocconi Institute for Data Science and Analytics Italy University of Bergamo Department of Human and Social Sciences Bergamo Italy

ISBN: (纸本)9798350308365

Evolutionary algorithms are effective techniques for optimizing non-linear and complex high-dimensional problems. However, most of them require a precise fine-tuning of their functioning settings to achieve satisfactory results. In this work, we propose a modified version of an evolutionary approach called the Evolutionary Algorithm for COmplex-process oPtimization (EACOP), designed to have a limited number of hyper-parameters. The base version of EACOP (bEACOP) combines different strategies, including the scatter search methodology, local searches, and a novel combination method based on path relinking to balance the exploration and exploitation phases. Our improved version (iEACOP) intensifies the exploration phase to escape from suboptimal search space areas where, on the contrary, bEACOP gets stuck. Our results show that iEACOP outperforms bEACOP on 27 out of 29 CEC 2017 test suite benchmark functions, exhibiting comparable performance against the three best algorithms of the CEC 2017 competition on single-objective bound-constrained real-parameter numerical optimization. The source code of bEACOP and iEACOP will be made publicly available on GitHub upon acceptance. © 2024 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Inductive Relation Prediction by Disentangled Subgraph Structure

引用

Tsinghua science and Technology 2024年第5期29卷 1566-1579页

作者： Guiduo Duan Rui Guo Wenlong Luo Guangchun Luo Tianxi Huang Laboratory of Intelligent Collaborative Computing University of Electronic Science and Technology of ChinaChengdu 611731Chinaand also with Trusted Cloud Computing and Big Data Key Laboratory of Sichuan ProvinceChengdu 611731China School of Computer Science and Engineering University of Electronic Science and Technology of ChinaChengdu 611731China Hangzhou NetEase Cloud Music Technology Co. Ltd.Hangzhou 310052China Department of Fundamental Courses Chengdu Textile CollegeChengdu 611700China

Currently,most existing inductive relation prediction approaches are based on subgraph structures,with subgraph features extracted using graph neural networks to predict ***,subgraphs may contain disconnected regions,which usually represent different semantic *** not all semantic information about the regions is helpful in relation prediction,we propose a relation prediction model based on a disentangled subgraph structure and implement a feature updating approach based on relevant semantic *** indirectly achieve the disentangled subgraph structure from a semantic perspective,the mapping of entity features into different semantic spaces and the aggregation of related semantics on each semantic space are *** disentangled model can focus on features having higher semantic relevance in the prediction,thus addressing a problem with existing approaches,which ignore the semantic differences in different subgraph ***,using a gated recurrent neural network,this model enhances the features of entities by sorting them by distance and extracting the path information in the ***,it is shown that when there are numerous disconnected regions in the subgraph,our model outperforms existing mainstream models in terms of both Area Under the Curve-Precision-Recall(AUC-PR)and Hits@*** prove that semantic differences in the knowledge graph can be effectively distinguished and verify the effectiveness of this method.

关键词： disentangled subgraph structure knowledge graph completion Gated Recurrent Unit(GRU) feature updating

来源：评论

学校读者我要写书评

暂无评论

SM2PNet: A Deep Learning Approach Towards Indian Stock Market Movement Prediction 8

SM2PNet: A Deep Learning Approach Towards Indian Stock Marke...

引用

8th IEEE International Conference for Convergence in Technology, I2CT 2023

作者： Patel, Manali Jariwala, Krupa Chattopadhyay, Chiranjoy SVNIT Department of CSE Surat India FLAME University School of Computing and Data Science Pune India

ISBN: (纸本)9798350334012

The objective of this study is to forecast the future price movements of equities listed on the National Stock Exchange (NSE) of India. To anticipate the future price movement, all prior statistical and machine learning techniques have focused on identifying latent temporal dependencies. In actuality, stock prices reflect all available information and are influenced by several external variables, making forecasting difficult. One such major element is the interdependence that exists between stock pairings from the same industry. By incorporating this relational dependence combined with the temporal dependency, we may attain improved prediction performance. In order to demonstrate this, we have created a model, SM2PNet (Stock Market Movement Prediction Network), which takes into consideration the characteristics of highly correlated firms in order to examine their impact on the stock price of the selected target company. We've analysed predefined sector-industry linkages in order to identify the most relevant peer firms. Sequential model long short-term memory (LSTM) is used to represent temporal dependence. The investigation confirms that SM2PNet beats all other available deep learning methods. © 2023 IEEE.

关键词： Financial markets

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：