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

Congress on Evolutionary Computation

作者： Gabriel Souto Masayoshi Aritsugi Israel Mendonça Luidi Simonetti Pedro Henrique González System Engineering and Computer Science Program Federal University of Rio de Janeiro Rio de Janeiro Brazil Faculty of Advanced Science and Technology Kumamoto University Kumamoto Japan

ISBN: (数字)9798350308365

ISBN: (纸本)9798350308372

This paper presents a hybrid BRKGA (Q-HBRKGA) that combines BRKGA with Q-learning and a Local Branching technique to solve the Knapsack Problem with Forfeits(KPF). The aim is to tackle this problem, a vari-ant of the 0–1 Knapsack Problem, where a penalty cost is imposed when both items of a forfeit pair are included in the solution. Notably, Q-HBRKGA achieves superior results compared to existing approaches, establishing a valid strategy for KPF problem-solving. Computational experiments, utilizing benchmark instances, demonstrate the efficacy of Q-HBRKGA by outperforming state-of-the-art methods documented in the literature.

关键词： Q-learning Costs Evolutionary computation Benchmark testing Problem-solving

来源：评论

学校读者我要写书评

暂无评论

Feature Selection based on Particle Swarm Optimization Algorithm for Sentiment Analysis Classification

Feature Selection based on Particle Swarm Optimization Algor...

引用

2021 International Conference on Intelligent technology, system and Service for Internet of Everything, ITSS-IoE 2021

作者： Nurcahyawati, Vivine Mustaffa, Zuriani Universitas Dinamika Faculty Technology And Informatics Department Of Information System Surabaya Indonesia Universiti Malaysia Pahang Faculty Computing Department Of Computer Science Pahang Malaysia

ISBN: (纸本)9781665433051

Online media serve as a potential secondary data source for studies on sentiment analysis. The current conditions of the data sources are very different, and it offers a variety of writing systems. Therefore, the results of accuracy in sentiment analysis are very important. An improved approach was proposed to increase the sentiment analysis accuracy based on text pre-processing and Naïve Bayes Classifier algorithm hybrid with Particle Swarm Optimization (NBC-PSO). Furthermore, the proposed algorithm solves the complex background problems about noise data and feature selection that affect the classification performance on sentiment analysis. This proceeded with the classification of positive or negative sentiments on these texts using NBC. Subsequently, the feature selection based on PSO was created to improve the accuracy. The experimental results showed that the proposed approach has a significant effect on sentiment score and polarity detection. © 2021 IEEE.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

Recognition of Urdu Handwritten Alphabet Using Convolutional Neural Network (CNN)

引用

computers, Materials & Continua 2022年第11期73卷 2967-2984页

作者： Gulzar Ahmed Tahir Alyas Muhammad Waseem Iqbal Muhammad Usman Ashraf Ahmed Mohammed Alghamdi Adel A.Bahaddad Khalid Ali Almarhabi Department of Computer Science University of South AsiaLahore54000Pakistan Department of Computer Science Lahore Garrison UniversityLahore54000Pakistan Department of Software Engineering Superior UniversityLahore54000Pakistan Department of Computer Science GC Women UniversitySialkot53310Pakistan Department of Software Engineering College of Computer Science and EngineeringUniversity of Jeddah21493Saudi Arabia Department of Information System Faculty of Computing and Information TechnologyKing Abdulaziz UniversityJeddah21589Saudi Arabia Department of Computer Science College of Computing in Al-QunfudahUmm Al-Qura UniversityMakkah24381Saudi Arabia

Handwritten character recognition systems are used in every field of life nowadays,including shopping malls,banks,educational institutes,*** is the national language of Pakistan,and it is the fourth spoken language in the ***,it is still challenging to recognize Urdu handwritten characters owing to their cursive *** paper presents a Convolutional Neural Networks(CNN)model to recognize Urdu handwritten alphabet recognition(UHAR)offline and online *** research contributes an Urdu handwritten dataset(aka UHDS)to empower future works in this *** offline systems,optical readers are used for extracting the alphabets,while diagonal-based extraction methods are implemented in online ***,our research tackled the issue concerning the lack of comprehensive and standard Urdu alphabet datasets to empower research activities in the area of Urdu text *** this end,we collected 1000 handwritten samples for each alphabet and a total of 38000 samples from 12 to 25 age groups to train our CNN model using online and offline ***,we carried out detailed experiments for character recognition,as detailed in the *** proposed CNN model outperformed as compared to previously published approaches.

关键词： Urdu handwritten text recognition handwritten dataset convolutional neural network artificial intelligence machine learning deep learning

来源：评论

学校读者我要写书评

暂无评论

A Triangular Stable Node Network based on Self-supervised Learning for personalized prediction

A Triangular Stable Node Network based on Self-supervised Le...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Liu, Qing Gao, Qian Fan, Jun Zhang, Zhiqiang 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 Jinan250014 China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology Shandong Academy of Sciences Jinan250353 China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan250014 China China Telecom Digital Intelligence Techonology Co Ltd. No.1999 Shunhua road Shandong Jinan250101 China

ISBN: (纸本)9798350368741

In recent years, research has illuminated the potency of implicit data processing in enhancing user preferences. Nevertheless, barriers remain in breaking through the constraints of implicit information. This study aims to bridge this gap by firstly constructing a triangular stable node network model, tailored to manage implicit information with precision. Recognizing the challenge of pinpointing novel structures within large-scale graphs, we propose SLTSNN-a triangular stable node network based on self-supervised learning for personalized prediction. SLTSNN innovates by maximizing mutual information between graph-level and patch-level representations, while augmenting graph representations through extended enhanced representations. Additionally, it incorporates triangular data associations and introduces a triangular allocation attention network, which emphasizes strongly correlated preference features among similar users. Furthermore, SLTSNN employs contrastive learning to maximize mutual information between graph vectors and hidden representations, distinguishing between high-order global and local representations. The model's effectiveness in enhancing user preferences and capturing new graph structures is evidenced by its performance on hit rate and normalized discounted cumulative gain metrics across three datasets. © 2025 IEEE.

关键词： graph contrastive learning graph neural networks recommender systems self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

Long Short-Term Memory and Word Embedding For Sentiment Analysis of User Review

Long Short-Term Memory and Word Embedding For Sentiment Anal...

引用

Smart technology (ICE-SMARTec), IEEE International Conference on

作者： Lia Silviana Erna Budhiarti Nababan Muhammad Zarlis Faculty Of Computer Science and Information Technology Universitas Sumatera Utara Medan Indonesia Department of Information System Bina Nusantara University Jakarta Indonesia

Accuracy in training sentiment analysis models for large number of review datasets is affected by the correct classification of sentiment labels. Improving the accuracy of sentiment labels, and text representation also affects the performance of sentiment analysis models. Deep learning methods have been widely used to solve various sentiment analysis problems. To improve the performance of deep learning in sentiment analysis, it is necessary to use the right labeling method and good text representation to be used as an embedding layer. This study proposes sentiment labeling using Lexicon and Long Short-Term Memory (LSTM) as well as used FastText as embedding words in sentiment classification. As a corpus, the InSet Lexicon Dictionary is employed for feature extraction. The sentiment data used is the reviews given by users on several applications provided on Google Play. The results showed that the LSTM network using Word-embedded FastText with a dimension of 300 words received a small error value of 0.111 with an accuracy of 95.55% for data labeled based on Lexicon.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Bibliometric and Social Media Analysis of the Nexus Between Blockchain technology and Finance 2nd

A Bibliometric and Social Media Analysis of the Nexus Betwee...

引用

2nd International Conference on Intelligent Manufacturing and Robotics, ICIMR 2024

作者： Ayodele, Olamide Emmanuel Ajibade, Temiloluwa Iyanuoluwa Oyebode, Oluwadare Joshua Akintoye, Kayode Akinlekan Ajayi, Babatunde Adedotun Adediran, Anthonia Oluwatosin Ajibade, Samuel-Soma M. Majeed, Anwar P. P. Abdul Luo, Yang Department of Banking and Finance Ekiti State University Ekiti State Ado Ekiti Nigeria Department of Business Management Scholar School System Birmingham United Kingdom Civil and Environmental Engineering Afe Babalola University Ekiti State Ado Ekiti Nigeria Department of Computer Science The Federal Polytechnic Ekiti State Ado Ekiti Nigeria Department of Cyber Security Faculty of Computing and Informatics Ladoke Akintola University of Technology Ogbomoso Nigeria Department of Real Estate Faculty of Built Environment Universiti Malaya KL Kuala Lumpur Malaysia Department of Data Science and Artificial Intelligence Faculty of Engineering and Technology Sunway University Selangor Malaysia Department of Computer Engineering Istanbul Ticaret University Istanbul Turkey Suzhou Taicang215400 China

ISBN: (纸本)9789819639489

This study explores Blockchain technology in the global financial industry using trends analysis, bibliometric analysis, and a literature appraisal using Elsevier Scopus data from 2016 to 2023. The Blockchain in Finance (BCF) study produced 185 publications: 53.5% papers, 45.4% conference proceedings, and 1.1% reviews. Analysis of the subject area revealed three important computer Science, Engineering, and Decision Sciences articles. However, source title analysis showed that ACM International Conference Proceeding Series, Sustainability Switzerland, and E3S Web of Conferences publish BCF research most often. According to the stakeholders study, Jon M. Truby and Qatar University (Qatar) are the top BCFin researchers and affiliations with 4% and % publications, respectively. China produces the most research on the topic. Due to active support from funding sources like the Chinese National Natural Science Foundation (NNSF), 18 publications have been funded. Co-occurrence of keywords The investigation indicated that BCFin’s top keywords include Blockchain, Finance, and Supply Chain Finance. Three clusters with 4–8 keywords, 132 linkages, and 866 TLS were found via cluster analysis. Keywords classify the clusters as Integrated Business Solutions (Cluster 1), Digital Commerce Infrastructure (Cluster 2), and Decentralized Financial Network (Cluster 3). The findings indicate that BCFin is a dynamic and influential multidisciplinary study field. BCFin has transformed the global financial sector by improving trust, transaction security, and communication. It still struggles with interoperability, system integration, and sustainability. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Decentralized finance

来源：评论

学校读者我要写书评

暂无评论

GLC++: Source-Free Universal Domain Adaptation through Global-Local Clustering and Contrastive Affinity Learning

arXiv

引用

arXiv 2024年

作者： Qu, Sanqing Zou, Tianpei Röhrbein, Florian Lu, Cewu Chen, Guang Tao, Dacheng Jiang, Changjun The School of Automotive Engineering Department of Computer Science Tongji University China The Faculty of Computer Science Chemnitz University of Technology Germany The Department of Computer Science Shanghai Jiao Tong University China The School of Computer Science Faculty of Engineering The University of Sydney Australia The Department of Computer Science Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University China

Deep neural networks often exhibit sub-optimal performance under covariate and category shifts. Source-Free Domain Adaptation (SFDA) presents a promising solution to this dilemma, yet most SFDA approaches are restricted to closed-set scenarios. In this paper, we explore Source-Free Universal Domain Adaptation (SF-UniDA) aiming to accurately classify "known" data belonging to common categories and segregate them from target-private "unknown" data. We propose a novel Global and Local Clustering (GLC) technique, which comprises an adaptive one-vs-all global clustering algorithm to discern between target classes, complemented by a local k-NN clustering strategy to mitigate negative transfer. Despite the effectiveness, the inherent closed-set source architecture leads to uniform treatment of "unknown" data, impeding the identification of distinct "unknown" categories. To address this, we evolve GLC to GLC++, integrating a contrastive affinity learning strategy. We examine the superiority of GLC and GLC++ across multiple benchmarks and category shift scenarios. Remarkably, in the most challenging open-partial-set scenarios, GLC and GLC++ surpass GATE by 16.7% and 18.6% in H-score on VisDA, respectively. GLC++ enhances the novel category clustering accuracy of GLC by 4.3% in open-set scenarios on Office-Home. Furthermore, the introduced contrastive learning strategy not only enhances GLC but also significantly facilitates existing methodologies. Copyright © 2024, The Authors. All rights reserved.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Evaluating Usability of Learning Disability Assessment system 8

Evaluating Usability of Learning Disability Assessment Syste...

引用

8th IEEE International Conference on Computing, Engineering and Design, ICCED 2022

作者： Fikriah Hamum Junaidi, Putri Sakinah Amira Imi, Nur Zakaria, Noor Azura Abdul Karim, Ruwinah Lubis, Muharman Rejab, Mazidah Mat International Islamic University Malaysia Kulliyyah of Information and Communication Technology Department of Computer Science Kuala Lumpur Malaysia Penawar Special Learning Centre Kuala Lumpur Malaysia Telkom University Information System Department Bandung Indonesia Universiti Tun Hussien Onn Malaysia Faculty of Computer Science and Information Technology Johor Malaysia

ISBN: (纸本)9781665453899

The Learning Disability Assessment system (LeDAS) entails crucial decision making to produce a diagnosis referring to the information inserted by the therapists and parents. In this manner, accuracy of the information system is a pivot to generate an effective system. Research evaluation of LeDAS is necessary due to the fact that it is a recently developed system with over 3,000 patients currently using it thus it is imperative to evaluate the system to measure its usability. The purpose of this research is to evaluate the usability of the developed LeDAS web-based system in order to ensure the system can fulfill the user's satisfaction and be usable. The conducted survey targets therapists and parents to collect data. The data produced from this study will be used to provide insight into the need of furthering proficiency in generating a satisfactory system. This evaluation analyzed using the descriptive statistic, exploratory factor analysis (EFA), reliability testing and hypothesis testing. The result showed that 5 hypotheses were supported. © 2022 IEEE.

关键词： Factor analysis

来源：评论

学校读者我要写书评

暂无评论

Generalized Normalized Euclidean Distance Based Fuzzy Soft Set Similarity for Data Classification

引用

computer systems Science & Engineering 2021年第7期38卷 119-130页

作者： Rahmat Hidayat Iwan Tri Riyadi Yanto Azizul Azhar Ramli Mohd Farhan Md.Fudzee Ansari Saleh Ahmar Faculty of Computer and Information Technology Universiti Tun Hussein Onn MalaysiaBatu PahatMalaysia Department of Information Technology Politeknik Negeri PadangPadangIndonesia Department of Information System Universitas Ahmad DahlanYogyakartaIndonesia Department of Statistics Universitas Negeri MakassarMakassarIndonesia

Classification is one of the data mining processes used to predict predetermined target classes with data learning *** study discusses data classification using a fuzzy soft set method to predict target classes *** study aims to form a data classification algorithm using the fuzzy soft set *** this study,the fuzzy soft set was calculated based on the normalized Hamming *** parameter in this method is mapped to a power set from a subset of the fuzzy set using a fuzzy approximation *** the classification step,a generalized normalized Euclidean distance is used to determine the similarity between two sets of fuzzy soft *** experiments used the University of California(UCI)Machine Learning dataset to assess the accuracy of the proposed data classification *** dataset samples were divided into training(75%of samples)and test(25%of samples)*** were performed in MATLAB R2010a *** experiments showed that:(1)The fastest sequence is matching function,distance measure,similarity,normalized Euclidean distance,(2)the proposed approach can improve accuracy and recall by up to 10.3436%and 6.9723%,respectively,compared with baseline ***,the fuzzy soft set method is appropriate for classifying data.

关键词： Soft set fuzzy soft set classification normalized euclidean distance similarity

来源：评论

学校读者我要写书评

暂无评论

Discovery of association rules between factors affecting user satisfaction in software project by FP-GROWTH Algorithm 18

Discovery of association rules between factors affecting use...

引用

18th International Conference on Electrical Engineering/Electronics, computer, Telecommunications and Information technology, ECTI-CON 2021

作者： Kaewbanjong, Katawut Intakosum, Sarun King Mongkut's Institute of Technology Ladkrabang Software System Engineering Laboratory Department of Computer Science Faculty of Science Bangkok Thailand

ISBN: (纸本)9780738111278

The main objective of this work was to find the association rules between factors affecting user satisfaction in software project by using an association rule discovery technique. Data from 191 software projects were collected and association rules between 15 Selected factors were discovered by FP-growth algorithm. Primarily, 281 association rules were discovered. Rules that were not directly related to user satisfaction were filtered out by simple criteria. In the end, 11 final association rules that passed those criteria were obtained with an average confidence value of 65.30%. These rules can incorporated in the planning and administration of a software project to gain utmost user satisfaction © 2021 IEEE.

关键词： Association rules

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：