2018 International Conference on Machine Learning and Cybernetics (ICMLC)最新文献

筛选
英文 中文
Predicting Tourists’ Behavior Of Virtual Museum Using Support Vector Machine With Feature Selection Technique 基于特征选择支持向量机的虚拟博物馆游客行为预测
2018 International Conference on Machine Learning and Cybernetics (ICMLC) Pub Date : 2018-07-01 DOI: 10.1109/ICMLC.2018.8526959
Krit Sriporn, Cheng-Fa Tsai
{"title":"Predicting Tourists’ Behavior Of Virtual Museum Using Support Vector Machine With Feature Selection Technique","authors":"Krit Sriporn, Cheng-Fa Tsai","doi":"10.1109/ICMLC.2018.8526959","DOIUrl":"https://doi.org/10.1109/ICMLC.2018.8526959","url":null,"abstract":"Multimedia technology has greatly influenced tourism industry in Thailand. It can increasingly promote Thai cultural tourism byapplying the virtual reality technology to create Chaiya national virtual museum. Significantly, the virtual reality method is considered as a modern and popular method integrating with a game design. The paper employs the method that selects a variety of information features and the appropriate characteristics from support vector machine classification technique in order to create a model to predict tourists’ behavior. The researchers adopt the feature selection methods consisting of the genetic search, the best-first search, and the greedy stepwise search algorithms integrated with the wrapper method. These methods are applied to evaluate the performance of Chaiya national virtual museum. In sum, the results of this work reveal the feature selection textbf{{method can select the best data set features and improve the efficiency of predictive model.","PeriodicalId":309312,"journal":{"name":"2018 International Conference on Machine Learning and Cybernetics (ICMLC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129226084","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
Measuring Pairwise Similarity of Tandem Mass Spectra Using Pair Hidden Markov Model 利用对隐马尔可夫模型测量串联质谱的两两相似性
2018 International Conference on Machine Learning and Cybernetics (ICMLC) Pub Date : 2018-07-01 DOI: 10.1109/ICMLC.2018.8527013
S. Ryu
{"title":"Measuring Pairwise Similarity of Tandem Mass Spectra Using Pair Hidden Markov Model","authors":"S. Ryu","doi":"10.1109/ICMLC.2018.8527013","DOIUrl":"https://doi.org/10.1109/ICMLC.2018.8527013","url":null,"abstract":"Protein identification is one of the major goals in proteomics. Clustering tandem mass spectra improves the speed and the accuracy of protein identification by reducing the number of spectra matched to a protein database and by constructing representative spectra with better signal-to-noise ratios. In order to build reliable clusters of spectra, it is essential to implement a good scoring method that measures the similarity of observed tandem mass spectra. In this study, we introduce pair-wise similarity scores using a Pair Hidden Markov Model (Pair HMM) and demonstrate the performance of our model using a real mass spectrometry dataset. The proposed scores performed very well in differentiating related pairs of spectra from unrelated pairs with a misclassification rate of 0.5%. Moreover, its performance was superior to a traditional approach.","PeriodicalId":309312,"journal":{"name":"2018 International Conference on Machine Learning and Cybernetics (ICMLC)","volume":"215 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121238168","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
Ecg Based Identification Under Different Physical Status 基于心电的不同身体状态识别
2018 International Conference on Machine Learning and Cybernetics (ICMLC) Pub Date : 2018-07-01 DOI: 10.1109/ICMLC.2018.8527005
Gang Zheng, Hong-Yuan Zhang, Shengzhen Ji
{"title":"Ecg Based Identification Under Different Physical Status","authors":"Gang Zheng, Hong-Yuan Zhang, Shengzhen Ji","doi":"10.1109/ICMLC.2018.8527005","DOIUrl":"https://doi.org/10.1109/ICMLC.2018.8527005","url":null,"abstract":"Relatively stable feature of Electrocardiogram (ECG) waveform in ECG based identification authentication is an important issue to be discovered in biometric. It can benefit the biomaterial which is weak and easy to be affected when it is collected under different physical status. From the paper, it was found that P waveform was stable when several ECG waveforms were overlapped under Matthew Effect rule, therefore P waveform period could be more dependent than other part of ECG waveform in identity. And this result was used in the following experiments. The experiments in the paper were designed to study whether ECG based identification was affected by the status of ECG signal collecting. The status contained four status pairs, that was, emotion status (calm, high pressure), eating (starve, satition), sleeping (full, lack) and health (healthy, tired/cold). From the result, Negative emotion and lacking sleeping reduced TPR slightly (about 2–3%), but there was no effect on both eating and health pair status. However, if we used ECG data mixed with all four statuses, the overall True Positive Rate (TPR) of identification reached around 85%.","PeriodicalId":309312,"journal":{"name":"2018 International Conference on Machine Learning and Cybernetics (ICMLC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129304395","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
An Improved Object Detection Method Based On Deep Convolution Neural Network For Smoke Detection 一种改进的基于深度卷积神经网络的烟雾检测方法
2018 International Conference on Machine Learning and Cybernetics (ICMLC) Pub Date : 2018-07-01 DOI: 10.1109/ICMLC.2018.8527037
Junying Zeng, Zuoyong Lin, Chuan-Da Qi, Xiaoxiao Zhao, Fan Wang
{"title":"An Improved Object Detection Method Based On Deep Convolution Neural Network For Smoke Detection","authors":"Junying Zeng, Zuoyong Lin, Chuan-Da Qi, Xiaoxiao Zhao, Fan Wang","doi":"10.1109/ICMLC.2018.8527037","DOIUrl":"https://doi.org/10.1109/ICMLC.2018.8527037","url":null,"abstract":"The smoke detection plays a very important role in fire alarm. However, the accuracy of smoke detection is low and difficult to detect in open space by traditional methods. In this paper, we introduce an improved object detection method based on deep convolution neural network(CNN) to address this issue. Firstly, we substitute the feature extractor (such as Inception Net and Resnet) in Various neural network object detectors for Faster R-CNN, Single Shot MultiBox Detector (SSD), Region based Fully Convolutional Networks (R-FCN). Secondly, the parametersof the object detection algorithm are optimized on MSCOCO dataset. Finally, the experiments are conducted on the smoke detection dataset. The experiments result demonstrate the mAP reached56.04% on the smoke detection dataset. Compared with the existing smoke detection methods, the present method has achieved good results both in accuracy and speed.","PeriodicalId":309312,"journal":{"name":"2018 International Conference on Machine Learning and Cybernetics (ICMLC)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117294511","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}
引用次数: 13
Identification of Attracting Attention In Thai Handicraft Products Using Self-Organizing Map 利用自组织地图识别泰国手工艺品的吸引力
2018 International Conference on Machine Learning and Cybernetics (ICMLC) Pub Date : 2018-07-01 DOI: 10.1109/ICMLC.2018.8526975
Natinai Jinsakul, Cheng-Fa Tsai
{"title":"Identification of Attracting Attention In Thai Handicraft Products Using Self-Organizing Map","authors":"Natinai Jinsakul, Cheng-Fa Tsai","doi":"10.1109/ICMLC.2018.8526975","DOIUrl":"https://doi.org/10.1109/ICMLC.2018.8526975","url":null,"abstract":"3D virtual design generates the attracting attention among the users as it can render the interaction between objects. Thai government supports marketing of Thai local products, but its website does not include 3D virtual products, which may possibly affects consumer attracting attention to promote Thai handicraft products. The objective of this work intends to employ Self-Organizing Map (SOM) algorithm to identify attracting attention in Thai handicraft products by utilizing the data collected from questionnaires after using mobile phone application that renders 3D virtual products. The questionnaires were distributed to 484 participants in Thailand. According to the simulation results, the SOM may perform fairly good clustering results with hexagonal topology to recognize the attracting attention in Thai handicraft products.","PeriodicalId":309312,"journal":{"name":"2018 International Conference on Machine Learning and Cybernetics (ICMLC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117115184","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 Two-Step Choice Privacy-Preservation Method for Check-in Data Publishing 签入数据发布的两步选择隐私保护方法
2018 International Conference on Machine Learning and Cybernetics (ICMLC) Pub Date : 2018-07-01 DOI: 10.1109/ICMLC.2018.8527034
Yang Zhao, Jianmin Han, Jianfeng Lu, Hao Peng, Zhaolong Hu, Lixia Wang
{"title":"A Two-Step Choice Privacy-Preservation Method for Check-in Data Publishing","authors":"Yang Zhao, Jianmin Han, Jianfeng Lu, Hao Peng, Zhaolong Hu, Lixia Wang","doi":"10.1109/ICMLC.2018.8527034","DOIUrl":"https://doi.org/10.1109/ICMLC.2018.8527034","url":null,"abstract":"Check-in data play an increasingly important role in mining users’ behavioral patterns and personalized recommendation etc. However, check-in data abuse also rises users’ concern about their privacy. Obfuscating one’s check-in data to another’s is an effective method. Existing approaches focus more on privacy preservation than on data utility. To the end, this paper proposes a two-step choice method. The method first clusters users into several clusters based on users’ check-in data. Then the method chooses a cluster, named substituting cluster, which is the nearest to the cluster which the publishing user belongs to. The cluster which the publishing user belongs to is named original cluster. The substituting cluster and the original cluster should satisfy the predefined privacy threshold. The second step is to find a user in substituting cluster, named substituting user, whose check-in data are the most similar to the publishing user. Finally, the method replaces the publishing user check-in data by the substituting user’s. Empirical evaluation shows that the proposed method can not only preserve the user’s privacy effectively, but also preserve higher data utility.","PeriodicalId":309312,"journal":{"name":"2018 International Conference on Machine Learning and Cybernetics (ICMLC)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117251084","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
Onamd: An Online Android Malware Detection Approach Onamd:一个在线Android恶意软件检测方法
2018 International Conference on Machine Learning and Cybernetics (ICMLC) Pub Date : 2018-07-01 DOI: 10.1109/ICMLC.2018.8526997
Rubata Riasat, Muntaha Sakeena, Abdul Hannan Sadiq, Yong-Ji Wang
{"title":"Onamd: An Online Android Malware Detection Approach","authors":"Rubata Riasat, Muntaha Sakeena, Abdul Hannan Sadiq, Yong-Ji Wang","doi":"10.1109/ICMLC.2018.8526997","DOIUrl":"https://doi.org/10.1109/ICMLC.2018.8526997","url":null,"abstract":"Android mobile phone is one of the most usable smartphone today which makes Android the most anticipated operating system in the market. However, the increase in malware threats with the growth in Android market cannot be neglected. Android is an open source platform which gives full leverage to developers on one side, but also provides an open door to malware. Dynamic analysis provides a comprehensive view of malware detection, but it is still subjective to the high-cost development and manual endeavors in test analysis. In this article, we propose a mechanism based on static and dynamic features for malware detection in Android. We leverage the proposed technique and develop a system, called an online Android Malware Detection Approach ONAMD. Initially, the ONAMD extracts the information (e.g., requested permissions, and basic data info, etc Next, it applies SVM and Random Forest algorithm that enhances the malware modeling capability to classify the application as benign or malicious. We applied our approach to 600 applications. The experimental result shows the efficiency of our approach which takes halftime and better recalls rate than Androguard.","PeriodicalId":309312,"journal":{"name":"2018 International Conference on Machine Learning and Cybernetics (ICMLC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117281193","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}
引用次数: 9
Knowledge Updating Method Based On Approximate Reduction Under Dominance Relations 优势关系下基于近似约简的知识更新方法
2018 International Conference on Machine Learning and Cybernetics (ICMLC) Pub Date : 2018-07-01 DOI: 10.1109/ICMLC.2018.8526979
Yan Li, Li Zhang, Tingting Wu, Junfen Chen
{"title":"Knowledge Updating Method Based On Approximate Reduction Under Dominance Relations","authors":"Yan Li, Li Zhang, Tingting Wu, Junfen Chen","doi":"10.1109/ICMLC.2018.8526979","DOIUrl":"https://doi.org/10.1109/ICMLC.2018.8526979","url":null,"abstract":"Rough set approach based on dominance- equivalence relation can be used to handle classification problems with preference ordered conditional attributes. It firstly extracts the most important information to the decisions, and then approximates target concepts and finally form the decision-making knowledge. In this paper, we study the issue of updating knowledge in classification problems under dynamic environments. When some samples are inserted or deleted, the update principle of dominating sets is given and the approximate reduction algorithm based on sample selection is developed. The proposed method only needs to individually consider the impact of changing samples on knowledge reduction, and therefore it can obviously reduce the storage space. More importantly, since it can utilize previous calculation results, the time cost of subsequent calculations is thus significantly reduced. Ten UCI data sets are selected in our experiments. The results show the effectiveness and efficiency of the proposed method.","PeriodicalId":309312,"journal":{"name":"2018 International Conference on Machine Learning and Cybernetics (ICMLC)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116091431","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
Predicting Future Visitors Of Restaurants Using Big Data 利用大数据预测未来餐厅的客流量
2018 International Conference on Machine Learning and Cybernetics (ICMLC) Pub Date : 2018-07-01 DOI: 10.1109/ICMLC.2018.8526963
Xu Ma, Yanshan Tian, Chu Luo, Yuehui Zhang
{"title":"Predicting Future Visitors Of Restaurants Using Big Data","authors":"Xu Ma, Yanshan Tian, Chu Luo, Yuehui Zhang","doi":"10.1109/ICMLC.2018.8526963","DOIUrl":"https://doi.org/10.1109/ICMLC.2018.8526963","url":null,"abstract":"For efficient and economical operation, restaurant owners need to accurately estimate the number of future customers. In this paper, we propose an approach to predict how many future visi-tors will go to a restaurant using big data and supervised learning. The included big data involves restaurant information, historical visits and historical reservations. With features constructed from the big data, our approach generates predictions by performing regression using a mix of K-Nearest-Neighbour, Random Forests and XGBoost. We evaluate our approach using large-scale realworld datasets from two restaurant booking websites. The eval- uation results show the effectiveness of our approach, as well as useful insights for future work.","PeriodicalId":309312,"journal":{"name":"2018 International Conference on Machine Learning and Cybernetics (ICMLC)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127214694","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}
引用次数: 5
Piece-Wise Kernel Regression for Example-Based Super-Resolution 基于示例的超分辨率分段核回归
2018 International Conference on Machine Learning and Cybernetics (ICMLC) Pub Date : 2018-07-01 DOI: 10.1109/ICMLC.2018.8527042
Yi Tang, Junhua Chen, Zuo Jiang
{"title":"Piece-Wise Kernel Regression for Example-Based Super-Resolution","authors":"Yi Tang, Junhua Chen, Zuo Jiang","doi":"10.1109/ICMLC.2018.8527042","DOIUrl":"https://doi.org/10.1109/ICMLC.2018.8527042","url":null,"abstract":"Many existed example-based super-resolution algorithms focus on learning a regression function which maps a low-resolution image patch to a high-resolution image patch. Even though this strategy often works well, the speciality of image patches is omitted during learning process. To this end, a novel piece-wised kernel regression algorithm for super-resolution is proposed for benefitting from the speciality of training image patches. The kernel-based regression function learned by this algorithm will vary along with the changing of low-resolution image patches, which enable the learned regression function more flexible to match the speciality of low-resolution image patches. Experimental results show the convinced performance of the reported algorithm.","PeriodicalId":309312,"journal":{"name":"2018 International Conference on Machine Learning and Cybernetics (ICMLC)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127600330","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
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学术官方微信
小红书