Proceedings of the 2019 2nd International Conference on Machine Learning and Machine Intelligence最新文献

筛选
英文 中文
Using Web Pages Dynamicity to Prioritise Web Crawling 使用网页动态来优先考虑网络爬虫
Nisreen Alderratia, M. Elsheh
{"title":"Using Web Pages Dynamicity to Prioritise Web Crawling","authors":"Nisreen Alderratia, M. Elsheh","doi":"10.1145/3366750.3366757","DOIUrl":"https://doi.org/10.1145/3366750.3366757","url":null,"abstract":"Web crawling is a process performed to collect web pages from the web, in order to be indexed and used for displaying the search results according to users' requirements. In addition, web crawlers must continually revisit web pages, to keep the search engine database updated. Moreover, it is fundamental to determine in the crawling process, the most important pages to be recrawled first. This is to avoid the time limitation and network issues that face the web crawling process. Thus, this research attempts to introduce a method that is used to indicate the crawler, specifically, in order to identify in what order it should recrawl web pages that have been crawled before, as to acquire more important and valuable pages earlier than others. In addition, the researchers proposed a web crawling strategy which is based on the topic similarity, accompanied with the dynamicity of web pages, where the crawler was downloading relevant pages and recrawling them recursively. Also, every time a change emerged in one of the pages, its counter increased. Therefore, if the page was relevant and changed frequently it would be considered an important page and was given a high priority in the crawling process. The obtained results indicated that using web pages' dynamicity is an effective way for prioritising web pages in the crawling process, in order to obtain the highest dynamic pages first, as there is a high possibility of being changed in terms of their content, before the least dynamic ones.","PeriodicalId":145378,"journal":{"name":"Proceedings of the 2019 2nd International Conference on Machine Learning and Machine Intelligence","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116140226","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}
引用次数: 2
NMF-based DCG Optimization for Collaborative Ranking on Recommendation Systems 基于nmf的推荐系统协同排序的DCG优化
Noor Ifada, Dziyaur Rohman Miftah Alim, M. K. Sophan
{"title":"NMF-based DCG Optimization for Collaborative Ranking on Recommendation Systems","authors":"Noor Ifada, Dziyaur Rohman Miftah Alim, M. K. Sophan","doi":"10.1145/3366750.3366753","DOIUrl":"https://doi.org/10.1145/3366750.3366753","url":null,"abstract":"A recommendation system predicts a top-N list of items that a target user might like by considering the user's previous rating history. In this paper, we solve the task of recommendation by developing a method that implements an NMF-based DCG optimization for collaborative ranking. Three main processes are applied to calculate the rating prediction for making the list of top-N item recommendations: constructing the user profile, initialising the latent-factor models using NMF (Non-Negative Matrix Factorization), and further optimising the models based on the DCG (Discounted Cumulative Gain). Extensive evaluations show that our proposed method beats all baseline methods on both the Precision and NDCG metrics. This fact confirms that NMF-based DCG optimization is an effective approach to enhance the recommendation performance and to deal with the sparsity problem.","PeriodicalId":145378,"journal":{"name":"Proceedings of the 2019 2nd International Conference on Machine Learning and Machine Intelligence","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114912611","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}
引用次数: 1
Using Distillation to Improve Network Performance after Pruning and Quantization 利用精馏提高网络在修剪和量化后的性能
Zhenshan Bao, Jiayang Liu, Wenbo Zhang
{"title":"Using Distillation to Improve Network Performance after Pruning and Quantization","authors":"Zhenshan Bao, Jiayang Liu, Wenbo Zhang","doi":"10.1145/3366750.3366751","DOIUrl":"https://doi.org/10.1145/3366750.3366751","url":null,"abstract":"As the complexity of processing issues increases, deep neural networks require more computing and storage resources. At the same time, the researchers found that the deep neural network contains a lot of redundancy, causing unnecessary waste, and the network model needs to be further optimized. Based on the above ideas, researchers have turned their attention to building more compact and efficient models in recent years, so that deep neural networks can be better deployed on nodes with limited resources to enhance their intelligence. At present, the deep neural network model compression method have weight pruning, weight quantization, and knowledge distillation and so on, these three methods have their own characteristics, which are independent of each other and can be self-contained, and can be further optimized by effective combination. This paper will construct a deep neural network model compression framework based on weight pruning, weight quantization and knowledge distillation. Firstly, the model will be double coarse-grained compression with pruning and quantization, then the original network will be used as the teacher network to guide the compressed student network. Training is performed to improve the accuracy of the student network, thereby further accelerating and compressing the model to make the loss of accuracy smaller. The experimental results show that the combination of three algorithms can compress 80% FLOPs and reduce the accuracy by only 1%.","PeriodicalId":145378,"journal":{"name":"Proceedings of the 2019 2nd International Conference on Machine Learning and Machine Intelligence","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130874822","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}
引用次数: 3
Report on a Hackathon for Car Navigation Using Traffic Risk Data 关于利用交通风险数据进行汽车导航的黑客马拉松的报告
S. Ito, K. Zettsu
{"title":"Report on a Hackathon for Car Navigation Using Traffic Risk Data","authors":"S. Ito, K. Zettsu","doi":"10.1145/3366750.3366758","DOIUrl":"https://doi.org/10.1145/3366750.3366758","url":null,"abstract":"Car drivers select their routes based on the information obtained about accidents and traffic congestion along the route. In recent years, nowcasting and forecasting of various traffic risk events is being performed by using diverse sensor data. However, there is no clarity as yet on what and how to communicate to the driver in case there are traffic risks on the route. In this paper, we have developed an environment that enables non UI experts to quickly create car navigation prototypes by using traffic risk data. This paper includes our report on a hackathon that we held using this environment. The hackathon theme was \"Develop a new car navigation system equipped with a mechanism that makes the driver aware of traffic risks and helps them determine the most appropriate driving routes.\" Twenty three researchers and professionals from the field of traffic engineering participated. Our results have brought certain common problems to the awareness of the experts. The information obtained from this report will be very beneficial for our community to determine the direction of collaboration.","PeriodicalId":145378,"journal":{"name":"Proceedings of the 2019 2nd International Conference on Machine Learning and Machine Intelligence","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134347544","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}
引用次数: 4
A Metaheuristic Algorithm for the Probabilistic Orienteering Problem 概率定向问题的一种元启发式算法
Xiaochen Chou, L. Gambardella, R. Montemanni
{"title":"A Metaheuristic Algorithm for the Probabilistic Orienteering Problem","authors":"Xiaochen Chou, L. Gambardella, R. Montemanni","doi":"10.1145/3366750.3366761","DOIUrl":"https://doi.org/10.1145/3366750.3366761","url":null,"abstract":"The Probabilistic Orienteering Problem (POP) is a variant of the orienteering problem where customers are available with a certain probability. In a previous work, we approximated its objective function value by using a Monte Carlo Sampling method. A heuristic speed-up criterion is considered in the objective function evaluator. In this work we study systematically the impact of the heuristic speed-up criterion in terms of precision and speed on the Monte Carlo evaluator, as well as the performance of a POP solver we propose, based on the embedding of the Monte Carlo evaluator into a Random Restart Local Search metaheuristic algorithm.","PeriodicalId":145378,"journal":{"name":"Proceedings of the 2019 2nd International Conference on Machine Learning and Machine Intelligence","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126064434","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}
引用次数: 3
Content based Image Retrieval with Rocchio Algorithm for Relevance Feedback Using 2D Image Feature Representation 基于二维图像特征表示的Rocchio相关反馈算法的图像检索
I. Siradjuddin, Aryandi Triyanto, S. MochammadKautsar
{"title":"Content based Image Retrieval with Rocchio Algorithm for Relevance Feedback Using 2D Image Feature Representation","authors":"I. Siradjuddin, Aryandi Triyanto, S. MochammadKautsar","doi":"10.1145/3366750.3366755","DOIUrl":"https://doi.org/10.1145/3366750.3366755","url":null,"abstract":"This paper presents Content based Image Retrieval with Relevance Feedback to retrieve relevant images based on an image query. Three main steps are proposed, first, obtain 2D feature representation of an image query and image database using the Integrated Color Co-Occurrence Matrix. This feature extraction method captures two features simultaneously, they are color and texture features. Second, compute cosine similarity measurement to retrieve similar images between features of an image query and features of all images in the database. Third, update the query features using Rocchio algorithm based on the user's relevance feedback, and recalculation of the cosine similarity between the updated feature of query and features of all images in the database. Experiments are conducted using Corel Image database that consists of 1000 images from ten classes. The proposed model for retrieving similar images achieved higher performance accuracy compare to the Content based Image Retrieval without Relevance feedback.","PeriodicalId":145378,"journal":{"name":"Proceedings of the 2019 2nd International Conference on Machine Learning and Machine Intelligence","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127402625","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}
引用次数: 3
ALT-Based Route Planning in Dynamic Time-Dependent Road Networks 动态时变路网中基于alt的路径规划
Famei He, Yin Xu, Xuren Wang, Anran Feng
{"title":"ALT-Based Route Planning in Dynamic Time-Dependent Road Networks","authors":"Famei He, Yin Xu, Xuren Wang, Anran Feng","doi":"10.1145/3366750.3366752","DOIUrl":"https://doi.org/10.1145/3366750.3366752","url":null,"abstract":"In order to solve the path planning problem of time-dependent road network(TDRN), an dynamic A* landmarks triangle algorithm(ALT) is proposed based on landmark-oriented technique and short-path tree(SPT). There are three main contributions: (1) constructing the shortest path tree in the preprocessing stage and calculating the distance between the landmark and other nodes; (2) using the dynamic shortest path tree to optimize the query in the point-to-point heuristic path planning process; (3) When the edge weight of the network changes, the shortest path tree is dynamically updated, and the structural characteristics of the tree are used to reduce the redundancy calculation. Experimental results indicate that the DALT algorithm not only outperforms the ALT implementation in point-to-point shortest path problem as the average query time is reduced by up to 51.71%, but also computes economically for updating shortest path tree compared with previous dynamic update algorithm as the average update times for increments are reduced by up to 9.90% with less modifications.","PeriodicalId":145378,"journal":{"name":"Proceedings of the 2019 2nd International Conference on Machine Learning and Machine Intelligence","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126298587","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}
引用次数: 2
Spam Detection Using Clustering-Based SVM 基于聚类支持向量机的垃圾邮件检测
Darshit Pandya
{"title":"Spam Detection Using Clustering-Based SVM","authors":"Darshit Pandya","doi":"10.1145/3366750.3366754","DOIUrl":"https://doi.org/10.1145/3366750.3366754","url":null,"abstract":"Spam detection task is of much more importance than earlier due to the increase in the use of messaging and mailing services. Efficient classification in such a variety of messages is a comparatively onerous task. There are a variety of machine learning algorithms used for spam detection, one of which is Support Vector Machine, also known as SVM. SVM is widely used to classify text-based documents. Though SVM is a widely used technique in document classification, its performance in the spam classification is not the best due to the uneven density of the training data. In order to improve the efficiency of SVM, I introduce a clustering-based SVM method. The training data is pre-processed using clustering algorithms and then the SVM classifier is implemented on the processed dataset. This method would increase the performance by overcoming the problem of uneven distribution of training data. The experimental results show that the performance is improved compared to that of SVM.","PeriodicalId":145378,"journal":{"name":"Proceedings of the 2019 2nd International Conference on Machine Learning and Machine Intelligence","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121683993","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}
引用次数: 7
Hydrological Time Series Prediction Model Based on Attention-LSTM Neural Network 基于注意力- lstm神经网络的水文时间序列预测模型
Yiran Li, Juan Yang
{"title":"Hydrological Time Series Prediction Model Based on Attention-LSTM Neural Network","authors":"Yiran Li, Juan Yang","doi":"10.1145/3366750.3366756","DOIUrl":"https://doi.org/10.1145/3366750.3366756","url":null,"abstract":"Constructing predictive models with neural networks has always been the focus of research in chaotic time series prediction. Since Hinton proposed the concept of deep learning in 2006, the development of neural networks is getting faster and faster, and a variety of neural networks appear. Among them, RNN neural network and LSTM neural network are applied to all fields of our daily life for the property of well-processed time series. Therefore, we use LSTM neural network to construct our model, and optimize the model by Attention mechanism to establish an Attention-LSTM hydrological time series prediction model. The experimental results show that the Attention-LSTM model has better improvement in the mean square error and absolute error of the predicted values than the common LSTM model and the traditional BP model. And due to the introduction of the Attention mechanism, it can highlight the key factors to some extent. influences.The experimental results show that the Attention-LSTM model has the advantages of high prediction accuracy and small lag error, which is helpful for the application of deep learning algorithm in hydrological time series prediction.","PeriodicalId":145378,"journal":{"name":"Proceedings of the 2019 2nd International Conference on Machine Learning and Machine Intelligence","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125537484","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}
引用次数: 6
Understanding Usability and User Acceptance of Usage-Based Insurance from Users' View 从用户的角度理解基于使用的保险的可用性和用户接受度
Juan Quintero, Z. Benenson
{"title":"Understanding Usability and User Acceptance of Usage-Based Insurance from Users' View","authors":"Juan Quintero, Z. Benenson","doi":"10.1145/3366750.3366759","DOIUrl":"https://doi.org/10.1145/3366750.3366759","url":null,"abstract":"Intelligent Transportation Systems (ITS) cover a variety of services related to topics such as traffic control and safe driving, among others. In the context of car insurance, a recent application for ITS is known as Usage-Based Insurance (UBI). UBI refers to car insurance policies that enable insurance companies to collect individual driving data using a telematics device. Collected data is analysed and used to offer individual discounts based on driving behaviour and to provide feedback on driving performance. Although there are plenty of advertising materials about the benefits of UBI, the user acceptance and the usability of UBI systems have not received research attention so far. To this end, we conduct two user studies: semi-structured interviews with UBI users and a qualitative analysis of 186 customer inquiries from a web forum of a German insurance company. We find that under certain circumstances, UBI provokes dangerous driving behaviour. These situations could be mitigated by making UBI transparent and the feedback customisable by drivers. Moreover, the country driving conditions, the policy conditions, and the perceived driving style influence UBI acceptance.","PeriodicalId":145378,"journal":{"name":"Proceedings of the 2019 2nd International Conference on Machine Learning and Machine Intelligence","volume":"223 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115618518","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}
引用次数: 2
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学术官方微信