International Conference on Machine Learning and Soft Computing最新文献

筛选
英文 中文
Evaluation of open information extraction methods using Reuters-21578 database 基于Reuters-21578数据库的公开信息提取方法评价
International Conference on Machine Learning and Soft Computing Pub Date : 2018-02-02 DOI: 10.1145/3184066.3184099
J. M. Rodríguez, H. Merlino, Patricia Pesado, Ramón García-Martínez
{"title":"Evaluation of open information extraction methods using Reuters-21578 database","authors":"J. M. Rodríguez, H. Merlino, Patricia Pesado, Ramón García-Martínez","doi":"10.1145/3184066.3184099","DOIUrl":"https://doi.org/10.1145/3184066.3184099","url":null,"abstract":"The following article shows the precision, the recall and the F1-measure for three knowledge extraction methods under Open Information Extraction paradigm. These methods are: ReVerb, OLLIE and ClausIE. For the calculation of these three measures, a representative sample of Reuters-21578 was used; 103 newswire texts were taken randomly from that database. A big discrepancy was observed, after analyzing the obtained results, between the expected and the observed precision for ClausIE. In order to save the observed gap in ClausIE precision, a simple improvement is proposed for the method. Although the correction improved the precision of Clausie, ReVerb turned out to be the most precise method; however ClausIE is the one with the better F1-measure.","PeriodicalId":109559,"journal":{"name":"International Conference on Machine Learning and Soft Computing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122268331","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
Machine learning based evaluation of functional index for coronary lesion severity 基于机器学习的冠状动脉病变严重程度功能指标评价
International Conference on Machine Learning and Soft Computing Pub Date : 2018-02-02 DOI: 10.1145/3184066.3184079
Due Minh Tran, M. Nguyen, Sang-Wook Lee
{"title":"Machine learning based evaluation of functional index for coronary lesion severity","authors":"Due Minh Tran, M. Nguyen, Sang-Wook Lee","doi":"10.1145/3184066.3184079","DOIUrl":"https://doi.org/10.1145/3184066.3184079","url":null,"abstract":"One of the physiology based clinical indices for coronary lesion severity, fractional flow reserve (FFR)is currently the gold standard for identifying the ischemia-causing stenosis in coronary circulation and for deciding revascularization of the clogged artery. In this study, we newly propose a machine learning based FFR prediction approach from geometric features of stenotic lesion and circulation conditions. We generated total 1,116 anatomic vessel models with various geometric features of a stenosis. FFR data were computed by 3D-0D coupled blood flow dynamics simulations. We employed a fully connected deep neural network model with four hidden layers and a sigmoidal activation function. The input layer has six neurons corresponds to geometric features of stenotic lesion as well as aortic pressure.\u0000 This novel data-driven approach for near-real time assessment of coronary lesion severity has promising potential in on-site routine clinical practices.","PeriodicalId":109559,"journal":{"name":"International Conference on Machine Learning and Soft Computing","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129430001","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
Face tracking with convolutional neural network heat-map 基于卷积神经网络热图的人脸跟踪
International Conference on Machine Learning and Soft Computing Pub Date : 2018-02-02 DOI: 10.1145/3184066.3184081
Nhu-Tai Do, Soohyung Kim, Hyung-Jeong Yang, Gueesang Lee, In Seop Na
{"title":"Face tracking with convolutional neural network heat-map","authors":"Nhu-Tai Do, Soohyung Kim, Hyung-Jeong Yang, Gueesang Lee, In Seop Na","doi":"10.1145/3184066.3184081","DOIUrl":"https://doi.org/10.1145/3184066.3184081","url":null,"abstract":"In this paper, we apply a heat-map approach for human face tracking. We utilize the heat-map extracted from the convolutional neural networks (CNN) for face / non-face classification problem. The CNN architecture we build is a shallow network to extract information that is meaningful in locating an object. In addition, we made many CNNs with changes in pool-size of the last layer to obtain a well-defined heat-map. Experiments in the Visual Tracking Object dataset show that the results of the method are very encouraging. This shows the effectiveness of our proposed method.","PeriodicalId":109559,"journal":{"name":"International Conference on Machine Learning and Soft Computing","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130534459","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
Student proficiency prediction on CNMOOC data 基于CNMOOC数据的学生熟练程度预测
International Conference on Machine Learning and Soft Computing Pub Date : 2018-02-02 DOI: 10.1145/3184066.3184098
Qi Wang, Liping Shen
{"title":"Student proficiency prediction on CNMOOC data","authors":"Qi Wang, Liping Shen","doi":"10.1145/3184066.3184098","DOIUrl":"https://doi.org/10.1145/3184066.3184098","url":null,"abstract":"MOOC continues to thrive in today and CNMOOC is one of the largest MOOC platform in China which cooperates with many high schools and universities. We try to hardness the data of students' learning behaviors to provide better personalized learning advice. Online education digitalizes students' learning behaviors which makes it convenient for analyzing students' behaviors. However the industrial data of MOOC is much sophisticated and sparse. In the paper, we introduce the system using machine learning methods to improve educational outcomes and describe some ideas tackling data sparsity in the scenario. We only focus on predicting student learning proficiency on specific course and compare different models under the scenario of inadequate data.","PeriodicalId":109559,"journal":{"name":"International Conference on Machine Learning and Soft Computing","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114837175","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
Classification of sentiments in short-text: an approach using mSMTP measure 短文本情感分类:一种使用mSMTP度量的方法
International Conference on Machine Learning and Soft Computing Pub Date : 2018-02-02 DOI: 10.1145/3184066.3184074
H. Kumar, B. Harish, S. V. A. Kumar, Manjunath Aradhya
{"title":"Classification of sentiments in short-text: an approach using mSMTP measure","authors":"H. Kumar, B. Harish, S. V. A. Kumar, Manjunath Aradhya","doi":"10.1145/3184066.3184074","DOIUrl":"https://doi.org/10.1145/3184066.3184074","url":null,"abstract":"Sentiment analysis or opinion mining is an automated process to recognize opinion, moods, emotions, attitude of individuals or communities through natural language processing, text analysis, and computational linguistics. In recent years, many studies concentrated on numerous blogs, tweets, forums and consumer review websites to identify sentiment of the communities. The information retrieved from social networking site will be in short informal text because of limited characters in blogging site or consumer review websites. Sentiment analysis in short-text is a challenging task, due to limitation of characters, user tends to shorten his/her conversation, which leads to misspellings, slang terms and shortened forms of words. Moreover, short-texts consists of more number of presence and absence of term/feature compared to regular text. In this work, our major goal is to classify sentiments into positive, negative or neutral polarity using new similarity measure. The proposed method embeds modified Similarity Measure for Text Processing (mSMTP) with K-Nearest Neighbor (KNN) classifier. The effectiveness of the proposed method is evaluated by comparing with Euclidean Distance, Cosine Similarity, Jaccard Coefficient and Correlation Coefficient. The proposed method is also compared with other classifiers like Support Vector Machine and Random Forest using benchmark dataset. The classification results are evaluated based on Accuracy, Precision, Recall and F-measure.","PeriodicalId":109559,"journal":{"name":"International Conference on Machine Learning and Soft Computing","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115528124","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}
引用次数: 8
An anti-phishing method based on feature analysis 一种基于特征分析的反网络钓鱼方法
International Conference on Machine Learning and Soft Computing Pub Date : 2018-02-02 DOI: 10.1145/3184066.3184082
M. Rajab
{"title":"An anti-phishing method based on feature analysis","authors":"M. Rajab","doi":"10.1145/3184066.3184082","DOIUrl":"https://doi.org/10.1145/3184066.3184082","url":null,"abstract":"Since the rapid advancement in computer networks and ebusiness technologies, massive numbers of sales transactions are performed on the World Wide Web on daily basis. These transactions necessitate online financial payments and the use of ebanking hence attracting phishers to target online users' credentials to access their financial information. Phishing involves developing forged websites that are visually identical to truthful websites in order to deceive online users. Different anti-phishing techniques have been proposed to reduce the risks of phishing mainly by educating users or using automated software. One of the main challenge for automated anti-phishing tools is to determine the more influential features in order to detect phishing activities. This article addresses this problem by conducting a thorough analysis using filtering methods against real phishing websites data. The methodology employed is based on data mining method called RIPPER to determine the performance of the classification systems derived by RIPPER and according to different evaluation measures such as error rate, false positives and false negatives.","PeriodicalId":109559,"journal":{"name":"International Conference on Machine Learning and Soft Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124705726","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
Face image generation system using attribute information with DCGANs 人脸图像生成系统利用属性信息与dcgan
International Conference on Machine Learning and Soft Computing Pub Date : 2018-02-02 DOI: 10.1145/3184066.3184071
Yurika Sagawa, M. Hagiwara
{"title":"Face image generation system using attribute information with DCGANs","authors":"Yurika Sagawa, M. Hagiwara","doi":"10.1145/3184066.3184071","DOIUrl":"https://doi.org/10.1145/3184066.3184071","url":null,"abstract":"In this paper, we propose an attribute added face image generation system using Deep Convolutional Generative Adversarial Networks(DCGANs). Convolutional Neural Networks(CNNs) can extract important features of an image and attain high precision in image classification tasks. In the proposed system, image features are extracted using CNNs, and attribute features added to image features, and attributes added images are generated by DCGANs. Specifically, we use the attributes of \"smile\" and \"male\", and work on a task of generating smile images from non-smile images, and a task of generating male images from female images. Since the training of the proposed system requires image pairs including with and without attributes, we use two extraction methods, 1)Usage of attribute label attached dataset, 2)Usage of cosine similarity. To obtain attribute features, we trained 4-layer CNNs which are the same architecture as Discriminator of GANs, to classify images into two classes, with and without attributes. Here, attribute features are defined as the averaged difference between image features with and without attributes, more specifically, the values in the final convolution layer in the 4-layer CNNs. We performed two kinds of evaluation experiments: the first one is a subjective evaluation experiment on items such as \"whether generated images have attributes\", the second one is a quantitative evaluation experiment for measuring whether the people shown in the input image and the generated image are the same person. As the results, excellent characteristics were obtained.","PeriodicalId":109559,"journal":{"name":"International Conference on Machine Learning and Soft Computing","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129591687","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
Solving document clustering problem through meta heuristic algorithm: black hole 用元启发式算法解决文档聚类问题:黑洞
International Conference on Machine Learning and Soft Computing Pub Date : 2018-02-02 DOI: 10.1145/3184066.3184085
Muhammad Rafi, Bilal Aamer, Mubashir Naseem, M. Osama
{"title":"Solving document clustering problem through meta heuristic algorithm: black hole","authors":"Muhammad Rafi, Bilal Aamer, Mubashir Naseem, M. Osama","doi":"10.1145/3184066.3184085","DOIUrl":"https://doi.org/10.1145/3184066.3184085","url":null,"abstract":"The paper proposed a soft computing approach to solve document clustering problem. Document clustering is a specialized clustering problem in which textual documents autonomously segregated to a number of identifiable, subject homogenous and smaller sub-collections (also called clusters). Identifying implicit textual patterns within the documents is a challenging aspect as there can be thousands of such textual features. Partition clustering algorithm like k-means is mainly used for this problem. There are several drawbacks in k-means algorithm such as (i) initial seeds dependency, and (ii) it traps into local optimal solution. Although every k-means solution may contain some good partial arrangements for clustering. Meta-heuristic algorithm like Black Hole (BH) uses certain trade-off of randomization and local search for finding the optimal and near optimal solution. Our motivation comes from the fact that meta-heuristic optimization can quickly produce a global optimal solution using random k-means initial solution. The contributions from this research are (i) an implementation of black hole algorithm using k-mean as embedding (ii) The phenomena of global search and local search optimization are used as parameters adjustments. A series of experiments are performed with our proposed method on standard text mining datasetslike: (i) NEWS20, (ii) Reuters and (iii) WebKB and results are evaluated on Purity and Silhouette Index. In comparison the proposed method outperforms the basic k-means, GA with k-means embedding and quickly converges to global or near global optimal solution.","PeriodicalId":109559,"journal":{"name":"International Conference on Machine Learning and Soft Computing","volume":"261 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133652270","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
EM based machine learning attack for XOR arbiter PUF 基于EM的XOR仲裁器PUF机器学习攻击
International Conference on Machine Learning and Soft Computing Pub Date : 2018-02-02 DOI: 10.1145/3184066.3184100
Y. Nozaki, M. Yoshikawa
{"title":"EM based machine learning attack for XOR arbiter PUF","authors":"Y. Nozaki, M. Yoshikawa","doi":"10.1145/3184066.3184100","DOIUrl":"https://doi.org/10.1145/3184066.3184100","url":null,"abstract":"The physical unclonable functions (PUFs) have been attracted attention to prevent semiconductor counterfeits. However, the risk of machine learning attack for an arbiter PUF, which is one of the typical PUFs, has been reported. Therefore, an XOR arbiter PUF, which has a resistance against the machine learning attack, was proposed. However, in recent years, a new machine learning attack using power consumption during the operation of the PUF circuit was reported. Also, it is important that the detailed tamper resistance verification of the PUFs to consider the security of the PUFs in the future. Therefore, this study proposes a new machine learning attack using electromagnetic waveforms for the XOR arbiter PUF. Experiments by an actual device evaluate the validity of the proposed method and the security of the XOR arbiter PUF.","PeriodicalId":109559,"journal":{"name":"International Conference on Machine Learning and Soft Computing","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134646391","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
Implementation of adversarial scenario to malware analytic 实现对抗性场景的恶意软件分析
International Conference on Machine Learning and Soft Computing Pub Date : 2018-02-02 DOI: 10.1145/3184066.3184078
Chia-Min Lai, Chia-Yu Lu, Hahn-Ming Lee
{"title":"Implementation of adversarial scenario to malware analytic","authors":"Chia-Min Lai, Chia-Yu Lu, Hahn-Ming Lee","doi":"10.1145/3184066.3184078","DOIUrl":"https://doi.org/10.1145/3184066.3184078","url":null,"abstract":"As the worldwide internet has non-stop developments, it comes with enormous amount automatically generated malware. Those malware had become huge threaten to computer users. A comprehensive malware family classifier can help security researchers to quickly identify characteristics of malware which help malware analysts to investigate in more efficient way. However, despite the assistance of the artificial intelligent (AI) classifiers, it has been shown that the AI-based classifiers are vulnerable to so-called adversarial attacks. In this paper, we demonstrate how the adversarial settings can be applied to the classifier of malware families classification. Our experimental results achieved high successful rate through the adversarial attack. We also find the important features which are ignored by malware analysts but useful in the future analysis.","PeriodicalId":109559,"journal":{"name":"International Conference on Machine Learning and Soft Computing","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114288022","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学术官方微信