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

7th International Conference on computer science and Computational Intelligence, CSCI 2022

作者： Febriansyah, Mochamad Rizky Nicholas Yunanda, Rezki Suhartono, Derwin Computer Science Department School of Computer Science Bina Nusantara University Jakarta11480 Indonesia Software Engineering Program Computer Science Department School of Computer Science Bina Nusantara University Jakarta11480 Indonesia

Stress detection is a growing topic in the field of natural language processing. The study of stress detection for mental health prediction has been proven to benefit the development of recommender systems and automated mental health assessments in previous studies. Additionally, the widespread usage of social media has served as a potential data source for developing such models. Our research tried to detect whether the users of social media were under stress or not. We used a dataset from Dreaddit consisting of posts from one of the popular social media platforms, Reddit. We propose a machine learning model consisting of Support Vector Machine (SVM), Naïve Bayes, Decision Tree, Random Forest, Bag of Words, and Term Frequency - inverse document frequency (TF-IDF) for stress detection. The final evaluation of the model achieved an 80.00% F-1 Score and 75.00% accuracy, and both were scored by SVM. © 2022 Elsevier B.V.. All rights reserved.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Physics-informed neural networks for modeling water flows in a river channel

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第3期5卷 1001-1015页

作者： Nazari, Luis Fernando Camponogara, Eduardo Seman, Laio Oriel Department of Mathematics Federal Institute of Education Science and Technology Catarinense Rio do Sul89160-202 Brazil Department of Automation and Systems Engineering Federal University of Santa Catarina Florianopolis88040-900 Brazil Program in Applied Computer Science Universidade Do Vale Do Itajai Itajai88302-901 Brazil

The impacts incurred by floods regularly affect the planets population, inflicting social and economic problems. Optimal control strategies based on reservoir management may aid in controlling floods and mitigating the resulting damage. To this end, an accurate dynamic representation of water systems is needed. In practice, flood control strategies rely on hydrological forecasting models obtained fromconceptual or data-drivenmethods. Encouraged by recent works, this research proposes a novel surrogate model for water flow in a river channel based on physics-informed neural networks (PINNs). This approach achieved promising results regarding the assimilation of real-data measurements and the parameter identification of differential equations that govern the underlying dynamics. This article investigates PINN performance in a simulated environment built directly from a configuration of the Saint-Venant equations. The objective is to create a suitable model with high prediction accuracy and scientifically consistent behavior for use in real-Time applications. The experiments revealed promising results for hydrological modeling and presented alternatives to solve the main challenges found in conventional methods while assisting in synthesizing real-world representations. Impact Statement-The research seeks to contribute to the hydrological modeling area with a surrogate model based on physicsinformed neural networks (PINNs) to water flow in a watershed. In practice, thesemodels use conceptual or *** models to reach the precision provided by themethodology use large numbers of physical parameters. These parameters can demand deep knowledge about the environment and are possibly hard to identify in a complex basin. On the other hand, while data-driven methods do not require such knowledge about the dynamic system, they depend on a reliable and useful database to guarantee the accuracy of system *** introduce PINNs as a viable solution for

关键词： Floods

来源：评论

学校读者我要写书评

暂无评论

The Deep Learning Approach For American Sign Language Detection

The Deep Learning Approach For American Sign Language Detect...

引用

2022 IEEE Creative Communication and Innovative Technology, ICCIT 2022

作者： Pangestu, Gusti Heryadi, Yaya Lukas Suparta, Wayan Arifin, Yulyani Bina Nusantara University School of Computer Science Computer Science Department Binus Graduate Program Computer Science Computer Science Department Jakarta Indonesia Bina Nusantara University Binus Graduate Program Computer Science Computer Science Department Jakarta11480 Indonesia Faculty of Engineering Jakarta12930 Indonesia Institut Teknologi Nasional Yogyakarta Faculty of Industrial Technology Department of Electrical Engineering Yogyakarta55281 Indonesia

ISBN: (纸本)9781665468763

Sign language has importance rule to deal with communication process especially with impairments hearing people. Sign language detection also attract lot of researchers to join the challenge of research to detect and recognize the sign language in the field of computer science. Hence, there is still no any standard approach and method to recognize the meaning in every pose of sign language. This research proposed a mechanism to detect Alphabet American Sign Language by utilizing Convolutional Neural Network (CNN) process. The CNN approach was chosen based on the ability and capability to recognize image. In this research, MNIST dataset is used for traning and testing process. The proposed CNN architecture produced 97% of accuracy that outperform the previous research using the same dataset which made this architecture promising. © 2022 IEEE.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Optimization of Node Reduction Using BRKGA for GNN-Based Traffic Speed Forecasting 13

Optimization of Node Reduction Using BRKGA for GNN-Based Tra...

引用

13th IEEE Congress on Evolutionary Computation, CEC 2024

作者： Inokuchi, Yuto González, Pedro Henrique Mendonça, Israel Aritsugi, Masayoshi Graduate School of Science and Technology Kumamoto University Kumamoto Japan Federal University of Rio de Janeiro System Engineering and Computer Science Program Rio de Janeiro Brazil Kumamoto University Faculty of Advanced Science and Technology Kumamoto Japan

ISBN: (纸本)9798350308365

While Spatio-Temporal Graph Convolutional Networks (STGCNs) are an effective method for traffic speed fore-casting, their training and inference tend to be time-consuming. In this paper, we aim to refine these networks by strategically reducing their number of nodes, thereby boosting computational efficiency. The nodes in these graphs represent data observed for road segments, and by analyzing the interconnections and layout of the graph, we can identify nodes with minimal contribution to overall performance. Removing these nodes can potentially decrease computation time while maintaining the prediction accuracy. We employ the Biased Random-Key Genetic Algorithm (BRKGA) to identify a good set of nodes for removal, based on a predefined percentage reduction of the original graph size (e.g., retaining 95 % of the original graph). We evaluate different graph size configurations, ranging from 95 % to 70 % node retention, to determine the least impactful node set performance. Our experiments on three real-world datasets reveal that reducing nodes can decrease computation time by up to 29%, and as a byproduct of removing noise, even improve the prediction accuracy. © 2024 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Deep Semantic and Attentive Network for Unsupervised Video Summarization

引用

ACM Transactions on Multimedia Computing, Communications and Applications 2022年第2期18卷 1-21页

作者： Zhong, Sheng-Hua Lin, Jingxu Lu, Jianglin Fares, Ahmed Ren, Tongwei College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Department of Electrical Engineering Computer Systems Engineering Program Faculty of Engineering at Shoubra Benha University Cairo Egypt State Key Laboratory for Novel Software Technology Nanjing University Nanjing210023 China

With the rapid growth of video data, video summarization is a promising approach to shorten a lengthy video into a compact version. Although supervised summarization approaches have achieved state-of-the-art performance, they require frame-level annotated labels. Such an annotation process is time-consuming and tedious. In this article, we propose a novel deep summarization framework named Deep Semantic and Attentive Network for Video Summarization (DSAVS) that can select the most semantically representative summary by minimizing the distance between video representation and text representation without any frame-level labels. Another challenge associated with video summarization tasks mainly originates from the difficulty of considering temporal information over a long time. Long Short-Term Memory (LSTM) performs well for temporal dependencies modeling but does not work well with long video clips. Therefore, we introduce a self-attention mechanism into our summarization framework to capture the long-range temporal dependencies among the frames. Extensive experiments on two popular benchmark datasets, i.e., SumMe and TVSum, show that our proposed framework outperforms other state-of-the-art unsupervised approaches and even most supervised methods. © 2022 Association for Computing Machinery.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Efficient Hyperparameter Optimization Using Deep Q-Network and BRKGA 13

Efficient Hyperparameter Optimization Using Deep Q-Network a...

引用

13th IEEE Congress on Evolutionary Computation, CEC 2024

作者： Kobayashi, Kosei Aritsugi, Masayoshi González, Pedro Henrique Mendonça, Israel Graduate School of Science and Technology Kumamoto University Kumamoto Japan Faculty of Advanced Science and Technology Kumamoto University Kumamoto Japan System Engineering and Computer Science Program Federal University of Rio de Janeiro Rio de Janeiro Brazil

ISBN: (纸本)9798350308365

Hyperparameter optimization (HPO) is paragon to maximize performance when designing machine learning models. Among different HPO methods, Genetic Algorithm (GA) based optimization is considered effective because it allows a wide and diverse range of solutions to be explored. However, GA's exploratory nature makes this type of algorithm to evaluate many solutions that do not improve the overall performance. This is specially costly when the objective function to be evaluated is time-consuming, like in the HPO field. In this paper, we propose an efficient hybrid algorithm that is able to reduce computational cost by combining deep reinforcement learning with the Biased Random Key Genetic Algorithm (BRKGA), a variant of genetic algorithms. Our reinforcement learning agent has a decision-making role during the population's fitness calculation, in which it filters out chromosomes that would not improve the overall fitness of the population. The agent uses small amounts of pre-trained data to identify trends in potentially good solutions, and carry out its decision process. We conduct experiments on eight different datasets to assess the effectiveness of the proposed method, and the results show that the proposed method can significantly reduce the computation time of hyperparameter search using BRKGA (up to 44% reduction in computational time) without compromising the quality of the solution (no statistically difference in results). © 2024 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Novel NBA Fantasy League driven by Engineered Team Chemistry and Scaled Position Statistics

Novel NBA Fantasy League driven by Engineered Team Chemistry...

引用

2023 IEEE International Conference on Big Data, BigData 2023

作者： Arkanath, Ganesh Gupta, Nishad Kurban, Hasan Sharma, Parichit Madhavan, K.R. Buxton, Elham Khorasani Dalkilic, Mehmet M. Texas A&m University at Qatar Electrical and Computer Engineering Doha Qatar Indiana University Computer Science Department BloomingtonIN United States Indiana University Data Science Program BloomingtonIN United States University of Illinois Computer Science Department SpringfieldIL United States

ISBN: (纸本)9798350324457

Fantasy Sports has a current market size of ${\$}$27B and is expected to grow more than ${\$}$84B in less than a decade. The intent is to create virtual teams that somehow reflect what would happen if the constituent players actually played in a team. Using individual player and team statistics, models can be trained to predict an outcome. But fans are left wanting more. To achieve a more realistic outcome, aspects of what makes live teams win need to be included: (1) transforming player statistics to reflect their relative importance with respect to a player position;(2) team chemistry (TC). In this work, we show a novel characterization of relative position statistics and a new description of TC. Drawn from the NBA's API, we form a data set to determine whether a fantasy team makes the playoffs using almost two dozen features, including TC. Various Machine Learning models are trained on this data and the best-performing model is offered to the users through a web service. Users can not only inspect fantasy teams and their TC but can also simulate their match-ups with existing 2023 NBA teams and utilize performance visualizations to help improve their team creation process. Our web service can be accessed at https://***/fantasyleague/, and the source code can be found at https://***/gany-15/nbafan. © 2023 IEEE.

关键词： big data data-mining feature-engineering nba-fantasy-league python-flask

来源：评论

学校读者我要写书评

暂无评论

Investigating the Impact of Data Augmentation for Fine-Grained Grocery Product Classification Based on Vision Transformer

Investigating the Impact of Data Augmentation for Fine-Grain...

引用

2023 International Conference on Artificial Intelligence Robotics, Signal and Image Processing, AIRoSIP 2023

作者： Rahmania, Rissa Heryadi, Yaya Lukas, Lukas Suparta, Wayan Sonata, Ilvico Bina Nusantara University Binus Graduate Program Computer Science Computer Science Department Jakarta11480 Indonesia Faculty of Engineering Jakarta12930 Indonesia Institut Teknologi Nasional Yogyakarta Faculty of Industrial Technology Department of Electrical Engineering Yogyakarta55281 Indonesia

ISBN: (纸本)9798350327472

The existence of fine-grained image classification supporting smart retail provides effectiveness in recognizing products with high similarity. However, the generic classification method performs poorly in identifying products from a subordinate category. This paper aims to identify augmentation techniques to leverage the Vision Transformer (ViT) model to classify the fine-grained grocery product, which involves embedding patches and transformer encoders to extract the main features. First, we develop a fine-grained image dataset with ColorJitter, CutOut, and combining both augmentations. Secondly, we perform experiments and analysis of ViT size, embedded patch size and image size in the patch embedding process. Lastly, the ViT model are evaluated according to the image sizes 224, 384, and 512 in accuracy, loss, and confusion matrix. The highest accuracy was obtained at 0.9922. The ColorJitter and CutOut improved the confusion matrix in ViT-B/16 and ViT-L/16 with an image size of 384 and 512. The results show that both augmentations in the ViT model are able to distinguish fine-grained grocery products. © 2023 IEEE.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Efficient Node Reduction Heuristic for GNN-Based Traffic Speed Forecasting 11

Efficient Node Reduction Heuristic for GNN-Based Traffic Spe...

引用

11th IEEE/ACM International Conference on Big Data Computing, Applications and Technologies, BDCAT 2024

作者： Inokuchi, Yuto Gonzalez, Pedro Henrique Aritsugi, Masayoshi Mendonca, Israel Kumamoto University Graduate School of Science and Technology Kumamoto Japan Federal University of Rio de Janeiro System Engineering and Computer Science Program Rio de Janeiro Brazil Kumamoto University Faculty of Advanced Science and Technology Kumamoto Japan

ISBN: (纸本)9798350367300

In this paper, we aim to reduce the number of nodes from Graph Neural Networks (GNNs), thereby simplifying models and reducing computational costs. GNNs are highly effective for various tasks, such as prediction, classification, and clustering, due to their ability to learn node and edge attributes and relationships, and they have been utilized for intelligent transportation systems recently by converting sensor networks into graph structures. Deep spatio-temporal neural networks, including Spatio-Temporal Graph Convolutional Networks (STGCNs), capture spatial and temporal dependencies, making them suitable for traffic speed forecasting, traffic demand prediction, and travel time estimation. Despite their success, GNNs face challenges in industrial applications due to significant memory usage and time consumption. In this paper, we propose a new approach to node reduction that outperforms existing methods in computational efficiency. Our experiments on two real-world traffic datasets demonstrate that using the heuristic and edge information to reduce nodes can cut computation time of optimization up to 95% and, by eliminating noise, can even enhance prediction accuracy. © 2024 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Exploring Shifted Domain Problem within MNIST Dataset

Exploring Shifted Domain Problem within MNIST Dataset

引用

2023 International Conference on computer science, Information Technology and engineering, ICCoSITE 2023

作者： Hidayaturrahman Heryadi, Yaya Lukas Suparta, Wayan Arifin, Yulyani Bina Nusatara University BINUS Graduate Program - Computer Science Computer Science Department Jakarta11480 Indonesia Faculty of Engineering Jakarta12930 Indonesia Institut Teknologi Nasional Yogyakarta Faculty of Industrial Technology Department of Electrical Engineering Yogyakarta55281 Indonesia

ISBN: (纸本)9798350320954

Domain data can be shifted in any direction so it will be shared in different distributions to its original domain. This could be a problem since the model was trained with different distributions. It is found that adversarial domain adaptation using domain adversarial neural networks (DANN) can help to solve this problem on some scale. DANN can minimize the discrepancy between source and target data so the model can work well in both domains. The experiment is done by utilizing MNIST dataset that shifted into some conditions. In a condition when the shifting of distribution is too far, DANN is struggling to maintain the knowledge extracted from source data which leads to underperformance in the source and target domain. In contrast, when the shifting is closer, DANN can easily fit the model so it can perform well in both domains. It proves DANN is one of the good approaches to performing domain adaptation in small discrepancies. © 2023 IEEE.

关键词： Adversarial Domain Adaptation Domain Shifting Problem MNIST Transfer Learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：