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

AMachine Learning Approach to User Profiling for Data Annotation of Online Behavior

computers, Materials & Continua 2024年第2期78卷 2419-2440页

作者： Moona Kanwal Najeed AKhan Aftab A.Khan Computer Science and Information Technology Department NED University of Engineering and TechnologyKarachiPakistan Computer Engineering Department Sir Syed University of Engineering and TechnologyKarachiPakistan College of Education Health and Human ServicesLongwood UniversityFarmvilleVAUSA

The user’s intent to seek online information has been an active area of research in user *** profiling considers user characteristics,behaviors,activities,and preferences to sketch user intentions,interests,and *** user characteristics can help capture implicit and explicit preferences and intentions for effective user-centric and customized content *** user’s complete online experience in seeking information is a blend of activities such as searching,verifying,and sharing it on social ***,a combination of multiple behaviors in profiling users has yet to be *** research takes a novel approach and explores user intent types based on multidimensional online behavior in information *** research explores information search,verification,and dissemination behavior and identifies diverse types of users based on their online engagement using machine *** research proposes a generic user profile template that explains the user characteristics based on the internet experience and uses it as ground truth for data *** feedback is based on online behavior and practices collected by using a survey *** participants include both males and females from different occupation sectors and different *** data collected is subject to feature engineering,and the significant features are presented to unsupervised machine learning methods to identify user intent classes or profiles and their *** techniques are evaluated,and the K-Mean clustering method successfully generates five user groups observing different user characteristics with an average silhouette of 0.36 and a distortion score of *** average is computed to identify user intent type *** user intent classes are then further generalized to create a user intent template with an Inter-Rater Reliability of 75%.This research successfully extracts different user types based on th

关键词： User intent cluster user profile online search information sharing user behavior search reasons

来源：评论

学校读者我要写书评

暂无评论

A Generative Image Steganography Based on Disentangled Attribute Feature Transformation and Invertible Mapping Rule

引用

computers, Materials & Continua 2025年第4期83卷 1149-1171页

作者： Xiang Zhang Shenyan Han Wenbin Huang Daoyong Fu School of Computer Science Nanjing University of Information Science and TechnologyNanjing210044China Engineering Research Center of Digital Forensics Nanjing University of Information Science and TechnologyMinistry of EducationNanjing210044China

Generative image steganography is a technique that directly generates stego images from secret *** traditional methods,it theoretically resists steganalysis because there is no cover ***,the existing generative image steganography methods generally have good steganography performance,but there is still potential room for enhancing both the quality of stego images and the accuracy of secret information ***,this paper proposes a generative image steganography algorithm based on attribute feature transformation and invertible mapping ***,the reference image is disentangled by a content and an attribute encoder to obtain content features and attribute features,***,a mean mapping rule is introduced to map the binary secret information into a noise vector,conforming to the distribution of attribute *** noise vector is input into the generator to produce the attribute transformed stego image with the content feature of the reference ***,we design an adversarial loss,a reconstruction loss,and an image diversity loss to train the proposed *** results demonstrate that the stego images generated by the proposed method are of high quality,with an average extraction accuracy of 99.4%for the hidden ***,since the stego image has a uniform distribution similar to the attribute-transformed image without secret information,it effectively resists both subjective and objective steganalysis.

关键词： Image information hiding generative information hiding disentangled attribute feature transformation invertible mapping rule steganalysis resistance

来源：评论

学校读者我要写书评

暂无评论

A dual hashing-based authentication and secure data transmission scheme for vehicular cloud environment using MECC with optimal resource allocation mechanism

引用

Soft Computing 2024年第17-18期28卷 10423-10437页

作者： Varalakshmi, J. Dhanasekaran, S. Department of Computer Science and Engineering Kalasalingam Academy of Research and Education Krishnankoil India Department of Information Technology Kalasalingam Academy of Research and Education Krishnankoil India

Vehicle cloud computing (VCC) is a recent area of study that blends vehicular networks with cloud computing, offering networking and sensor capabilities to vehicles for interaction with other vehicles and roadside infrastructure. Integrating unidentified vehicles and infrastructure through a public network has raised concerns about security and privacy in VCC. Several researchers have proposed secure authentication mechanisms to address these issues and ensure secure data transmission in VCC. However, exchanging vehicle data in a vehicular cloud (VC) system presents specific challenges, including maintaining data privacy and implementing lightweight authentication procedures. Therefore, this study proposes an efficient authentication and secure data transfer mechanism for VC systems. The proposed approach utilizes Dual Hashing-based Secure Hashing Algorithm-384 (DHS384) and Modified Elliptical Curve Cryptography (MECC). An optimal resource allocation (RA) scheme is introduced to allocate VC resources optimally to a suitable virtual machine using the Improved Harris Hawks Optimization (IHHO) algorithm. Simulation results demonstrate that the proposed method outperforms existing approaches and enhances security. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2024.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

A Multi-Objective Clustered Input Oriented Salp Swarm Algorithm in Cloud Computing

引用

computers, Materials & Continua 2024年第12期81卷 4659-4690页

作者： Juliet A.Murali Brindha T. Department of Computer Science and Engineering Noorul Islam Centre for Higher EducationKumaracoil629180India Department of Information Technology Noorul Islam Centre for Higher EducationKumaracoil629180India

Infrastructure as a Service(IaaS)in cloud computing enables flexible resource distribution over the Internet,but achieving optimal scheduling remains a *** resource allocation in cloud-based environments,particularly within the IaaS model,poses persistent *** methods often struggle with slow opti-mization,imbalanced workload distribution,and inefficient use of available *** limitations result in longer processing times,increased operational expenses,and inadequate resource deployment,particularly under fluctuating *** overcome these issues,a novel Clustered Input-Oriented Salp Swarm Algorithm(CIOSSA)is *** approach combines two distinct strategies:Task Splitting Agglomerative Clustering(TSAC)with an Input Oriented Salp Swarm Algorithm(IOSSA),which prioritizes tasks based on urgency,and a refined multi-leader model that accelerates optimization processes,enhancing both speed and *** continuously assessing system capacity before task distribution,the model ensures that assets are deployed effectively and costs are *** dual-leader technique expands the potential solution space,leading to substantial gains in processing speed,cost-effectiveness,asset efficiency,and system throughput,as demonstrated by comprehensive *** a result,the suggested model performs better than existing approaches in terms of makespan,resource utilisation,throughput,and convergence speed,demonstrating that CIOSSA is scalable,reliable,and appropriate for the dynamic settings found in cloud computing.

关键词： Cloud computing clustering resource allocation scheduling swam algorithms optimization common with in the subject discipline

来源：评论

学校读者我要写书评

暂无评论

Representation learning: serial-autoencoder for personalized recommendation

引用

Frontiers of computer Science 2024年第4期18卷 61-72页

作者： Yi ZHU Yishuai GENG Yun LI Jipeng QIANG Xindong WU School of Information Engineering Yangzhou UniversityYangzhou 225127China Key Laboratory of Knowledge Engineering with Big Data(Ministry of Education of the People’s Republic of China) Hefei University of TechnologyHefei 230009China School of Computer Science and Information Engineering Hefei University of TechnologyHefei 230009China

Nowadays,the personalized recommendation has become a research hotspot for addressing information *** this,generating effective recommendations from sparse data remains a ***,auxiliary information has been widely used to address data sparsity,but most models using auxiliary information are linear and have limited *** to the advantages of feature extraction and no-label requirements,autoencoder-based methods have become quite ***,most existing autoencoder-based methods discard the reconstruction of auxiliary information,which poses huge challenges for better representation learning and model *** address these problems,we propose Serial-Autoencoder for Personalized Recommendation(SAPR),which aims to reduce the loss of critical information and enhance the learning of feature ***,we first combine the original rating matrix and item attribute features and feed them into the first autoencoder for generating a higher-level representation of the ***,we use a second autoencoder to enhance the reconstruction of the data representation of the prediciton rating *** output rating information is used for recommendation *** experiments on the MovieTweetings and MovieLens datasets have verified the effectiveness of SAPR compared to state-of-the-art models.

关键词： personalized recommendation autoencoder representation learning collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

Bootstrap-Based Layerwise Refining for Causal Structure Learning

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第6期5卷 2708-2722页

作者： Xiang, Guodu Wang, Hao Yu, Kui Guo, Xianjie Cao, Fuyuan Song, Yukun Hefei University of Technology Key Laboratory of Knowledge Engineering with the Big Data of Ministry of Education Hefei230601 China Hefei University of Technology School of Computer Science and Information Engineering Hefei230601 China Shanxi University School of Computer and Information Technology Taiyuan030006 China

Learning causal structures from observational data is critical for causal discovery and many machine learning tasks. Traditional constraint-based methods first adopt conditional independence (CI) tests to learn a global skeleton layer by layer and then orient the undirected edges to obtain a causal structure. However, the reliability of these statistical tests largely depends on the quality of data samples. In real-life scenarios, the presence of data noise or limited samples often makes many CI tests unreliable at each layer in the skeleton learning phase, leading to an inaccurate skeleton. As the number of layers increases, the inaccurate skeleton will continue to impair the skeleton construction of subsequent layers. Furthermore, an unreliable skeleton hampers the skeleton orientation procedure, resulting in an unsatisfactory causal structure. In this article, we propose a Bootstrap-based layerwise refining (BLR) algorithm for causal structure learning, which includes two new procedures to solve the above problems. First, BLR utilizes a novel layerwise skeleton refining procedure to construct the global skeleton layer by layer based on the bootstrap sampling. Second, BLR employs a collective skeleton orientation procedure that incorporates scoring techniques to collectively orient the global skeleton. The experimental results show that BLR outperforms the state-of-the-art methods on the benchmark Bayesian Network datasets. © 2020 IEEE.

关键词： Refining

来源：评论

学校读者我要写书评

暂无评论

Smart automated highway lighting system using IoT: a survey

引用

Energy Informatics 2024年第1期7卷 76页

作者： Achar, Tejaswini Eshwar Rekha, C. Shreyas, J. Department of Computer Science and Engineering Government Engineering College Koppal Talakal India Department of Information Science and Engineering Bapuji Institute of Engineering and Technology Davanagere India Department of Information Technology Manipal Institute of Technology Bengaluru Manipal Academy of Higher Education Manipal India

Efficient highway lighting is crucial for ensuring road safety and reducing energy consumption and costs. Traditional highway lighting systems rely on timers or simple photosensors, leading to inefficient operation by illuminating lights when not needed or failing to adjust to changing conditions. The emergence of the Internet of Things (IoT) and related technologies has enabled the development of smart automated highway lighting systems that can dynamically control illumination levels based on real-time data. This paper provides a comprehensive review of the current state-of-the-art in smart automated highway lighting systems employing IoT technologies. Key components, communication protocols, data processing techniques, and lighting control strategies are discussed. The integration of renewable energy sources and energy storage systems is explored for environmentally sustainable operations. Practical implementation case studies are analyzed to highlight benefits and challenges. Open research issues and future directions for further enhancements are identified. © The Author(s) 2024.

关键词： Street lighting

来源：评论

学校读者我要写书评

暂无评论

Adaptive VDI Session Placement via User Logoff Prediction

引用

Machine Intelligence Research 2025年第1期22卷 189-200页

作者： Wenping Fan Puhui Meng Yu Tian Min-Ling Zhang Yao Zhang School of Computer Science and Engineering Southeast UniversityNanjing210096China VMware Information Technology(China)Limited Beijing100190China Key Laboratory of Computer Network and Information Integration(Southeast University) Ministry of EducationNanjing210096China

After the global pandemic,DaaS(desktop as a service)has become the first choice of many companies’remote working *** the desktops are usually deployed in the public cloud when using DaaS,customers are more cost-sensitive which boosts the requirement of proactive power *** researches in this area focus on virtual desktop infrastructure(VDI)session logon behavior modeling,but for the remote desktop service host(RDSH)-shared desktop pools,logoff optimization is also *** systems place sessions by round-robin or in a pre-defined order without considering their logoff ***,these approaches usually suffer from the situation that few left sessions prevent RDSH servers from being powered-off which introduces cost *** this paper,we propose session placement via adaptive user logoff prediction(SODA),an innovative compound model towards proactive RDSH session ***,an ensemble machine learning model that can predict session logoff time is combined with a statistical session placement bucket model to place RDSH sessions with similar logoff time in a more centralized manner on RDSH ***,the infrastructure cost-saving can be improved by reducing the resource waste introduced by those RDSH hosts with very few hanging sessions left for a long *** on real RDSH pool data demonstrate the effectiveness of the proposed proactive session placement approach against existing static placement techniques.

关键词： Virtual desktop infrastructure(VDI)resource management remote desktop service logoff prediction adaptive modeling session placement

来源：评论

学校读者我要写书评

暂无评论

Integrated feature selection and ensemble learning for heart disease detection: a 2-tier approach with ALAN and ET-ABDF machine learning model

引用

International Journal of information technology (Singapore) 2024年第7期16卷 4489-4503页

作者： Mandula, Aruna Vijaya Kumar, Baby Shalini Department of Computer Science and Engineering Kalasalingam Academy of Research Education Department of Information Technology Kalasalingam Academy of Research Education

The findings of this investigation give a novel approach to the forecasting of heart disease. For the purpose of determining significant features, it is a 2-tier procedure that uses a combination of the analysis of variance (ANOVA) and Least Absolute Shrinkage and Selection Operator (lasso) regression known as ALAN. In addition to this, it uses the Ensemble Technique with Adaptive Boosted Decision Fusion (ET-ABDF) in order to enhance its accuracy. An improvement in the detection of critical properties for predictive modelling is achieved through the use of the ALAN technique. With an accuracy of 88.0%, precision of 89.81%, recall of 89.80%, and an F1 Score of 89.00%, the ET-ABDF model shows outstanding results in the identification of cardiac disease. The outstanding result of 96.21% for the area under the curve (AUC) shows its strong ability to differentiate across several groups. It has been established through the comparative analysis that the model that has been provided displays better results in comparison to other algorithms. It is possible that in the future, undertaking more research on new techniques for choosing characteristics and expanding studies to encompass a larger spectrum of cardiovascular problems will have the potential to increase the accuracy and practicability of heart disease prediction models in real-world healthcare settings. © Bharati Vidyapeeth's Institute of computer Applications and Management 2024.

关键词： Adaptive Boosted Decision Fusion (ET-ABDF) ALAN ANOVA Lasso regression

来源：评论

学校读者我要写书评

暂无评论

PBCounter:weighted model counting on pseudo-boolean formulas

引用

Frontiers of computer Science 2025年第3期19卷 55-63页

作者： Yong LAI Zhenghang XU Minghao YIN College of Computer Science and Technology Jilin UniversityChangchun 130012China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin UniversityChangchun 130012China School of Computer Science and Information Technology Northeast Normal UniversityChangchun 130017China

In Weighted Model Counting(WMC),we assign weights to literals and compute the sum of the weights of the models of a given propositional formula where the weight of an assignment is the product of the weights of its *** current WMC solvers work on Conjunctive Normal Form(CNF)***,CNF is not a natural representation for human-being in many *** by the stronger expressive power of Pseudo-Boolean(PB)formulas than CNF,we propose to perform WMC on PB *** on a recent dynamic programming algorithm framework called ADDMC for WMC,we implement a weighted PB counting tool *** compare PBCounter with the state-of-the-art weighted model counters SharpSAT-TD,ExactMC,D4,and ADDMC,where the latter tools work on CNF with encoding methods that convert PB constraints into a CNF *** experiments on three domains of benchmarks show that PBCounter is superior to the model counters on CNF formulas.

关键词： weighted model counting pseudo-boolean constraint algebraic decision diagrams preprocessing techniques

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：