发布求助
文献互助 智能选刊 最新文献

2022 5th Asia Conference on Machine Learning and Computing (ACMLC)最新文献

筛选
英文 中文
PiXelNet: A DL-Based method for Diagnosing Lung Cancer using the Histopathological images PiXelNet:一种基于dl的肺癌组织病理图像诊断方法
2022 5th Asia Conference on Machine Learning and Computing (ACMLC) Pub Date : 2022-12-01 DOI: 10.1109/ACMLC58173.2022.00021
Nimai Chand Das Adhikari, Bijon Guha, Arpana Alka, Utsav Das
{"title":"PiXelNet: A DL-Based method for Diagnosing Lung Cancer using the Histopathological images","authors":"Nimai Chand Das Adhikari, Bijon Guha, Arpana Alka, Utsav Das","doi":"10.1109/ACMLC58173.2022.00021","DOIUrl":"https://doi.org/10.1109/ACMLC58173.2022.00021","url":null,"abstract":"Cancer is a group of diseases caused by abnormal cell growth, eventually leading to death. Cancer symptoms include chronic cough, breathing difficulties, weight loss, muscle stiffness, oedema, and bruises. Cancer detection increases with the stages, but unfortunately, the fatality also increases. In this research, we propose a pipeline coined as PiXelNet, which uses a classification system based on Convolutional Neural Networks (CNNs) that identifies three distinct kinds of lung cancer on histopathological images. The first step of the proposed network consists of a medical imaging analysis pipeline with models like ResNet, Efficient NetBO and MobileNet. We found that EfficientNet outperforms the other two models with a test accuracy of 99.33% and a loss of 0.0066. The second stage involves identifying the key areas from the original input test image with the feature extracted values. Using this strategy, the doctor or pathologist will immediately access all the crucial imaging heat maps and the network analysis report.","PeriodicalId":375920,"journal":{"name":"2022 5th Asia Conference on Machine Learning and Computing (ACMLC)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124898868","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Prototype and Metric Based Prediction for Data-Efficient Training 基于原型和度量的数据高效训练预测
2022 5th Asia Conference on Machine Learning and Computing (ACMLC) Pub Date : 2022-12-01 DOI: 10.1109/acmlc58173.2022.00019
Gaowei Zhou
{"title":"Prototype and Metric Based Prediction for Data-Efficient Training","authors":"Gaowei Zhou","doi":"10.1109/acmlc58173.2022.00019","DOIUrl":"https://doi.org/10.1109/acmlc58173.2022.00019","url":null,"abstract":"We propose a prototype- and metric-based prediction method together with several training pipelines suitable for training a network without using any additional data in the few-shot learning tasks with different intra-class variances. Being tested on two datasets commonly used for few-shot learning, our method has shown satisfactory ability to improve data efficiency and prevent overfitting. It even competes with the meta-learning-based method trained with a lot of extra labeled samples on the dataset with low intra-class variance and shows no significant performance gap when it comes to the dataset with a high intra-class variance. We reported 99.0% acc on the Omniglot dataset and 48.0% acc on the mini-ImageNet for 5-way 5-shot tasks.","PeriodicalId":375920,"journal":{"name":"2022 5th Asia Conference on Machine Learning and Computing (ACMLC)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127592312","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On the Instances and Application of Routing Problem with Loading Constraints 带负载约束的路由问题的实例及应用
2022 5th Asia Conference on Machine Learning and Computing (ACMLC) Pub Date : 2022-12-01 DOI: 10.1109/ACMLC58173.2022.00029
Yanru Lv, Junmin Yi
{"title":"On the Instances and Application of Routing Problem with Loading Constraints","authors":"Yanru Lv, Junmin Yi","doi":"10.1109/ACMLC58173.2022.00029","DOIUrl":"https://doi.org/10.1109/ACMLC58173.2022.00029","url":null,"abstract":"Packing problem and vehicle routing problem have always been the hot issues in the field of logistics and operations research, and they are NP-hard problems. In order to meet the requirements of practical transport and storage, the integrated problem of these two kinds of problems – vehicle routing problem with loading constraints is constantly targeted. Therefore, scholars continue to explore its models and solutions to meet the increasingly complex transport demand in practice. This article reviews the recent literature of vehicle routing problem with loading constraints, including those practically critical loading-related constraints, variation problems due to new constraints or targets. The solution method for vehicle routing problem with loading constraints is also briefly summarized. Furthermore, the problem instances and application are focused, and some research perspectives are proposed finally.","PeriodicalId":375920,"journal":{"name":"2022 5th Asia Conference on Machine Learning and Computing (ACMLC)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127740752","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An Evolutionary Strategy Based Training Optimization of Supervised Machine Learning Algorithms (EStoTimeSMLAs) 基于进化策略的监督机器学习算法训练优化(EStoTimeSMLAs)
2022 5th Asia Conference on Machine Learning and Computing (ACMLC) Pub Date : 2022-12-01 DOI: 10.1109/ACMLC58173.2022.00011
Matthias Lermer, Christoph Reich, D. Abdeslam
{"title":"An Evolutionary Strategy Based Training Optimization of Supervised Machine Learning Algorithms (EStoTimeSMLAs)","authors":"Matthias Lermer, Christoph Reich, D. Abdeslam","doi":"10.1109/ACMLC58173.2022.00011","DOIUrl":"https://doi.org/10.1109/ACMLC58173.2022.00011","url":null,"abstract":"Evolutionary strategy is increasingly used for optimization in various machine learning problems. It can scale very well, even to high dimensional problems, and its ability to globally self optimize in flexible ways provides new and exciting opportunities when combined with more recent machine learning methods. This paper describes a novel approach for the optimization of models with a data driven evolutionary strategy. The optimization can directly be applied as a preprocessing step and is therefore independent of the machine learning algorithm used. The experimental analysis of six different use cases show that, on average, better results are attained than without evolutionary strategy. Furthermore it is shown, that the best individual models are also achieved with the help of evolutionary strategy. The six different use cases were of different complexity which reinforces the idea that the approach is universal and not depending on specific use cases.","PeriodicalId":375920,"journal":{"name":"2022 5th Asia Conference on Machine Learning and Computing (ACMLC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116054217","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Advanced Machine Learning Framework for Efficient Plant Disease Prediction 高效植物病害预测的先进机器学习框架
2022 5th Asia Conference on Machine Learning and Computing (ACMLC) Pub Date : 2022-12-01 DOI: 10.1109/acmlc58173.2022.00015
M. Aswath, S. Sowdeshwar, M. Saravanan, Satheesh K. Perepu
{"title":"Advanced Machine Learning Framework for Efficient Plant Disease Prediction","authors":"M. Aswath, S. Sowdeshwar, M. Saravanan, Satheesh K. Perepu","doi":"10.1109/acmlc58173.2022.00015","DOIUrl":"https://doi.org/10.1109/acmlc58173.2022.00015","url":null,"abstract":"Recently, Machine Learning (ML) methods are built-in as an important component in many smart agriculture platforms. In this paper, we explore the new combination of advanced ML methods for creating a smart agriculture platform where farmers could reach out for assistance from the public, or a closed circle of experts. Specifically, we focus on an easy way to assist the farmers in understanding plant diseases where the farmers can get help to solve the issues from the members of the community. The proposed system utilizes deep learning techniques for identifying the disease of the plant from the affected image, which acts as an initial identifier. Further, Natural Language Processing techniques are employed for ranking the solutions posted by the user community. In this paper, a message channel is built on top of Twitter, a popular social media platform to establish proper communication among farmers. Since the effect of the solutions can differ based on various other parameters, we extend the use of the concept drift approach and come up with a good solution and propose it to the farmer. We tested the proposed framework on the benchmark dataset, and it produces accurate and reliable results.","PeriodicalId":375920,"journal":{"name":"2022 5th Asia Conference on Machine Learning and Computing (ACMLC)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122844055","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Rough Set Model and Approximations in Fuzzy Formal Contexts 模糊形式环境下的粗糙集模型与近似
2022 5th Asia Conference on Machine Learning and Computing (ACMLC) Pub Date : 2022-12-01 DOI: 10.1109/ACMLC58173.2022.00018
Yu-Ru Syau, E. Lin
{"title":"Rough Set Model and Approximations in Fuzzy Formal Contexts","authors":"Yu-Ru Syau, E. Lin","doi":"10.1109/ACMLC58173.2022.00018","DOIUrl":"https://doi.org/10.1109/ACMLC58173.2022.00018","url":null,"abstract":"Given a set of objects G with a set of attributes M and a binary relation I, a formal context (G, M, I) corresponds to a Boolean-valued information table in rough set theory, and the kernel relation of the function from G to M which maps each object of G to its afterset. This coincides with the indiscernibility relation of the Boolean-valued information table. Rough set model and Variable-Precision model (VP-model) under a formal context can be formulated based on the associated kernel relation on the objects set. $alpha$-fuzzified rough set model and VP-model under a fuzzy formal context are formulated analogously. We present an example to demonstrate the proposed $alpha$-fuzzified rough set model and VP-model under a fuzzy formal context.","PeriodicalId":375920,"journal":{"name":"2022 5th Asia Conference on Machine Learning and Computing (ACMLC)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133873753","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Employee Turnover Prediction based on Machine Learning Model 基于机器学习模型的员工离职预测
2022 5th Asia Conference on Machine Learning and Computing (ACMLC) Pub Date : 2022-12-01 DOI: 10.1109/ACMLC58173.2022.00013
Lihe Ma
{"title":"Employee Turnover Prediction based on Machine Learning Model","authors":"Lihe Ma","doi":"10.1109/ACMLC58173.2022.00013","DOIUrl":"https://doi.org/10.1109/ACMLC58173.2022.00013","url":null,"abstract":"Research shows that high turnover rate will inevitably damage the sustainable and healthy development of the enterprise. Thanks to the rapid development of artificial intelligence technology, it is possible to build a model to predict employee turnover intension by analyzing employee turnover data. This study uses employee data of a company on the Kaggle platform, proposes an oversampling method for predicting employee turnover in view of data imbalance in the data set. Four models Gaussian NB, support vector machine for classification (SVC), K-Nearest Neighbor (KNN) and Gradient Boosting were established and trained to analyze the employee turnover features and predict the occurrence of employee turnover events.","PeriodicalId":375920,"journal":{"name":"2022 5th Asia Conference on Machine Learning and Computing (ACMLC)","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124739570","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Comparison of Clustering Method to Determine Depot Location for a Bike-sharing Operation 一种聚类方法在共享单车运营中确定仓库位置的比较
2022 5th Asia Conference on Machine Learning and Computing (ACMLC) Pub Date : 2022-12-01 DOI: 10.1109/ACMLC58173.2022.00030
Kanokporn Boonjubut, H. Hasegawa
{"title":"A Comparison of Clustering Method to Determine Depot Location for a Bike-sharing Operation","authors":"Kanokporn Boonjubut, H. Hasegawa","doi":"10.1109/ACMLC58173.2022.00030","DOIUrl":"https://doi.org/10.1109/ACMLC58173.2022.00030","url":null,"abstract":"Bike-sharing schemes have become a popular and environmentally friendly transportation mode. This paper focuses on imbalances caused by problems with insufficient bikes or docking stations in such schemes, which lead to operating costs in terms of total distance due to the need to relocate bikes. Here, a method is proposed, based on cluster analysis, for considering depot location in bike-sharing schemes. The main objective is to reduce operating costs by minimizing the total distance required for relocating bikes. First, a method for predicting demand for bikes is presented. Then, the K-means and WK-means are compared to determine the number and location of depots. The last step is to use this method to compare the total distance required for different depot location options. The results indicate that the proposed method performs well in terms of reducing the total distance required.","PeriodicalId":375920,"journal":{"name":"2022 5th Asia Conference on Machine Learning and Computing (ACMLC)","volume":"44 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134087663","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The Design of English Translation Software Based on Machine Learning Technology 基于机器学习技术的英语翻译软件设计
2022 5th Asia Conference on Machine Learning and Computing (ACMLC) Pub Date : 2022-12-01 DOI: 10.1109/ACMLC58173.2022.00014
Xiaoshan Zeng
{"title":"The Design of English Translation Software Based on Machine Learning Technology","authors":"Xiaoshan Zeng","doi":"10.1109/ACMLC58173.2022.00014","DOIUrl":"https://doi.org/10.1109/ACMLC58173.2022.00014","url":null,"abstract":"With the increasing frequency of our country’s international communication and the popularization and penetration of mobile Internet into people’s work and life styles in modern society, the level of social informatization has also increased. In order not to be eliminated by this era, people must follow the pace of development of this era, always keep an eye on and receive the latest information from all over the world. Most of these materials are published on the Internet in foreign languages. Therefore, language has become the biggest obstacle for people to obtain information. As machine translation technology is restricted in terms of convenience and cost control, people’s need for machine translation or machine translation technology has become more and more urgent. This paper studies the design of English translation software (ETS) based on machine learning technology (MLT). By introducing MLT into ETS, a new neural machine translation method is proposed, and related experiments are used to test the effectiveness of the translation method. The designed translation software has been evaluated for translation quality. The experimental results show that as the arc length distribution increases, the translation quality (TTQ) decreases. The English translation software designed in this paper is of great importance to the research and development of machine translation.","PeriodicalId":375920,"journal":{"name":"2022 5th Asia Conference on Machine Learning and Computing (ACMLC)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131763130","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An Optimal Travel Route Optimization Model Based on Ant Colony Optimization Algorithm 基于蚁群优化算法的最优出行路线优化模型
2022 5th Asia Conference on Machine Learning and Computing (ACMLC) Pub Date : 2022-12-01 DOI: 10.1109/ACMLC58173.2022.00026
Lei Zhang, Peng Sun
{"title":"An Optimal Travel Route Optimization Model Based on Ant Colony Optimization Algorithm","authors":"Lei Zhang, Peng Sun","doi":"10.1109/ACMLC58173.2022.00026","DOIUrl":"https://doi.org/10.1109/ACMLC58173.2022.00026","url":null,"abstract":"Travel planning is an important part of tourism. Unlike traditional experience journeys, these journeys developed using mathematical modeling techniques are more scientifically reliable. The mathematical model of travel planning problem is based on tourism marketing problem, which can be solved by ant trap algorithm. At the same time, the development of information technology has led to the transformation of tourism travel organization from the traditional experience based design to a higher level. In this work, this paper focuses on the use of advanced ant algorithm to solve the travel booking problem, self-guided route planning problem and intelligent route planning problem. First, this paper proposes an advanced solution to the ACO based travel assignment problem. In order to realize the ant trap algorithm to solve the travel route problem, when solving the travel quota problem, the ant trap algorithm should obtain the optimal solution with high probability, and the solution time of the algorithm should be relatively short. Secondly, this paper improves the path selection probability and pheromone updating rules, locally searches the optimal path, optimizes the algorithm solving process, and determines the logic parameters of the algorithm. Through performance simulation analysis, the algorithm proposed in this work solves the line problem, with high search accuracy and short solution time.","PeriodicalId":375920,"journal":{"name":"2022 5th Asia Conference on Machine Learning and Computing (ACMLC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127336939","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信