2011 10th International Conference on Machine Learning and Applications and Workshops最新文献

筛选
英文 中文
Using Machine Learning to Detect Cyberbullying 使用机器学习检测网络欺凌
Kelly Reynolds, April Kontostathis, Lynne Edwards
{"title":"Using Machine Learning to Detect Cyberbullying","authors":"Kelly Reynolds, April Kontostathis, Lynne Edwards","doi":"10.1109/ICMLA.2011.152","DOIUrl":"https://doi.org/10.1109/ICMLA.2011.152","url":null,"abstract":"Cyber bullying is the use of technology as a medium to bully someone. Although it has been an issue for many years, the recognition of its impact on young people has recently increased. Social networking sites provide a fertile medium for bullies, and teens and young adults who use these sites are vulnerable to attacks. Through machine learning, we can detect language patterns used by bullies and their victims, and develop rules to automatically detect cyber bullying content. The data we used for our project was collected from the website Formspring.me, a question-and-answer formatted website that contains a high percentage of bullying content. The data was labeled using a web service, Amazon's Mechanical Turk. We used the labeled data, in conjunction with machine learning techniques provided by the Weka tool kit, to train a computer to recognize bullying content. Both a C4.5 decision tree learner and an instance-based learner were able to identify the true positives with 78.5% accuracy.","PeriodicalId":439926,"journal":{"name":"2011 10th International Conference on Machine Learning and Applications and Workshops","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131169358","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}
引用次数: 388
Adaptive Neuro Fuzzy Inference System, Neural Network and Support Vector Machine for Caller Behavior Classification 自适应神经模糊推理系统、神经网络和支持向量机的呼叫者行为分类
Pretesh B. Patel, T. Marwala
{"title":"Adaptive Neuro Fuzzy Inference System, Neural Network and Support Vector Machine for Caller Behavior Classification","authors":"Pretesh B. Patel, T. Marwala","doi":"10.1109/ICMLA.2011.24","DOIUrl":"https://doi.org/10.1109/ICMLA.2011.24","url":null,"abstract":"A classification system that accurately categorizes caller behavior within Interactive Voice Response systems would assist in developing good automated self service applications. This paper details the implementation of such a classification system for a pay beneficiary application. Adaptive Neuro-Fuzzy Inference System (ANFIS), Feed forward Artificial Neural Network (ANN) and Support Vector Machine (SVM) classifiers were created. Exceptional results were achieved. The ANN classifiers are the preferred models. ANN classifiers achieved 100% classification on 'Say account', 'Say amount' and 'Select beneficiary' unseen data. The ANN classifier yielded 95.42% accuracy on 'Say confirmation' unseen data.","PeriodicalId":439926,"journal":{"name":"2011 10th International Conference on Machine Learning and Applications and Workshops","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134089612","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
Street View Challenge: Identification of Commercial Entities in Street View Imagery 街景挑战:街景图像中商业实体的识别
A. Zamir, A. Darino, M. Shah
{"title":"Street View Challenge: Identification of Commercial Entities in Street View Imagery","authors":"A. Zamir, A. Darino, M. Shah","doi":"10.1109/ICMLA.2011.181","DOIUrl":"https://doi.org/10.1109/ICMLA.2011.181","url":null,"abstract":"This paper presents our submission to the Street View Challenge of identifying commercial entities in street view imagery. The provided data set of the challenge consists of approximately 129K street view images tagged with GPScoordinates. The problem is to identify different types of businesses visible in these images. Our solution is based on utilizing the textual information. However, the textual content of street view images is challenging in terms of variety and complexity, which limits the success of the approaches that are purely based on processing the content. Therefore, we use a method which leverages both the textual content of the images and business listings, in order to accomplish the identification task successfully. The robustness of our method is due to the fact that the information obtained from the different resources is cross-validated leading to significant improvements compared to the baselines. The experiments show approximately 70% of success rate on the defined problem.","PeriodicalId":439926,"journal":{"name":"2011 10th International Conference on Machine Learning and Applications and Workshops","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132787657","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}
引用次数: 27
Development of a Beam Source Modeling Technique for a Flattening Filter Free (FFF) Beam 无压平滤波(FFF)光束源建模技术的发展
W. Cho, Jeong-Hoon Park, W. Jung, T. Suh, K. Kielar, E. Mok, Ruijiang Li, L. Xing
{"title":"Development of a Beam Source Modeling Technique for a Flattening Filter Free (FFF) Beam","authors":"W. Cho, Jeong-Hoon Park, W. Jung, T. Suh, K. Kielar, E. Mok, Ruijiang Li, L. Xing","doi":"10.1109/ICMLA.2011.54","DOIUrl":"https://doi.org/10.1109/ICMLA.2011.54","url":null,"abstract":"This study was focused on a new beam source modeling technique for a flattening filter free (FFF) beam. The model was based on a previous three source model, and improved by introducing off axis ratio (OAR) of photon fluence to the primary and scattered photon sources to generate cone shaped dose profiles. The model parameters and the OAR were optimized from measured head scatter factors and a dose profile with 40 x 40 cm2 field size by using line search optimization algorithm. The model was validated by comparing various dose profiles on 6 and 10 MV FFF beam from a True Beam STx linear accelerator. Planar dose distributions for clinically used radiation fields were also calculated and compared with measured data. All calculated dose profiles were agreed with the measured data within 1.5% for 6 MV FFF beam, and within 1% for 10 MV FFF beam. The calculated planar doses showed good passing rates (> 94%) at 3%/3 mm of gamma indexing criteria. This model expected to be easily applicable to any FFF beams for treatment planning systems because it only required measured PDD, dose profiles and output factors which were easily acquired during conventional beam commissioning process.","PeriodicalId":439926,"journal":{"name":"2011 10th International Conference on Machine Learning and Applications and Workshops","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129354874","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
Statistical Learning for File-Type Identification 文件类型识别的统计学习
Siddharth Gopal, Yiming Yang, Konstantin Salomatin, J. Carbonell
{"title":"Statistical Learning for File-Type Identification","authors":"Siddharth Gopal, Yiming Yang, Konstantin Salomatin, J. Carbonell","doi":"10.1109/ICMLA.2011.135","DOIUrl":"https://doi.org/10.1109/ICMLA.2011.135","url":null,"abstract":"File-type Identification (FTI) is an important problem in digital forensics, intrusion detection, and other related fields. Using state-of-the-art classification techniques to solve FTI problems has begun to receive research attention, however, general conclusions have not been reached due to the lack of thorough evaluations for method comparison. This paper presents a systematic investigation of the problem, algorithmic solutions and an evaluation methodology. Our focus is on performance comparison of statistical classifiers (e.g. SVM and kNN) and knowledge-based approaches, especially COTS (Commercial Off-The-Shelf) solutions which currently dominate FTI applications. We analyze the robustness of different methods in handling damaged files and file segments. We propose two alternative criteria in measuring performance: 1) treating file-name extensions as the true labels, and 2) treating the predictions by knowledge based approaches on intact files, these rely on signature bytes as the true labels (and removing these signature bytes before testing each method). In our experiments with simulated damages in files, SVM and kNN substantially outperform all the COTS solutions we tested, improving classification accuracy very substantially -- some COTS methods cannot identify damaged files at all.","PeriodicalId":439926,"journal":{"name":"2011 10th International Conference on Machine Learning and Applications and Workshops","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115210811","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}
引用次数: 41
State Aggregation by Growing Neural Gas for Reinforcement Learning in Continuous State Spaces 连续状态空间中用于强化学习的生长神经气体状态聚合
Michael Baumann, H. K. Büning
{"title":"State Aggregation by Growing Neural Gas for Reinforcement Learning in Continuous State Spaces","authors":"Michael Baumann, H. K. Büning","doi":"10.1109/ICMLA.2011.134","DOIUrl":"https://doi.org/10.1109/ICMLA.2011.134","url":null,"abstract":"One of the conditions for the convergence of Q-Learning is to visit each state-action pair infinitely (or at least sufficiently) often. This requirement raises problems for large or continuous state spaces. Particularly, in continuous state spaces a discretization sufficiently fine to cover all relevant information usually results in an extremely large state space. In order to speed up and improve learning it is highly beneficial to add generalization to Q-Learning and thus being able to exploit experiences gained earlier. To achieve this, we compute a state space abstraction with a combination of growing neural gas and Q-Learning. This abstraction respects similarity in the state and action space and is constructed based on information achieved from interaction with the environment during learning. We examine the proposed algorithm on a continuous-state reinforcement learning problem and show that the approximated state space and the generalization speed up learning.","PeriodicalId":439926,"journal":{"name":"2011 10th International Conference on Machine Learning and Applications and Workshops","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115140164","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}
引用次数: 11
On a Distributed Approach for Density-Based Clustering 基于密度的分布式聚类方法研究
Nhien-An Le-Khac, Mohand Tahar Kechadi
{"title":"On a Distributed Approach for Density-Based Clustering","authors":"Nhien-An Le-Khac, Mohand Tahar Kechadi","doi":"10.1109/ICMLA.2011.108","DOIUrl":"https://doi.org/10.1109/ICMLA.2011.108","url":null,"abstract":"Efficient extraction of useful knowledge from very large datasets is still a challenge, mainly when the datasets are distributed, heterogeneous and of different quality depending of the various nodes involved. To reduce the overhead cost due to communications, most of the existing distributed clustering approaches generates global models by aggregating local results obtained on each individual node. The complexity and quality of solutions depend highly on the quality of the aggregation. In this respect, we propose distributed density-based clustering that both reduces the communication overheads and improves the quality of the global models by considering the shapes of local clusters. From preliminary results we show that this algorithm is very promising.","PeriodicalId":439926,"journal":{"name":"2011 10th International Conference on Machine Learning and Applications and Workshops","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116391236","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
Discriminative Optimization of String Similarity and Its Application to Biomedical Abbreviation Clustering 字符串相似度判别优化及其在生物医学缩写聚类中的应用
Atsuko Yamaguchi, Yasunori Yamamoto, Jin-Dong Kim, T. Takagi, A. Yonezawa
{"title":"Discriminative Optimization of String Similarity and Its Application to Biomedical Abbreviation Clustering","authors":"Atsuko Yamaguchi, Yasunori Yamamoto, Jin-Dong Kim, T. Takagi, A. Yonezawa","doi":"10.1109/ICMLA.2011.58","DOIUrl":"https://doi.org/10.1109/ICMLA.2011.58","url":null,"abstract":"Many string similarity measures have been developed to deal with the variety of expressions in natural language texts. With the abundance of such measures, we should consider the choice of measures and its parameters to maximize the performance for a given task. During our preliminary experiment to find the best measure and its parameters for the task of clustering terms to improve our abbreviation dictionary in life science, we found that chemical names had different characteristics in their character sequences compared to other terms. Based on the observation, we experimented with four string similarity measures to test the hypothesis, gchemical names has a different morphology, thus computation of their similarity should be differed from that of other terms.h The experimental results show that the edit distance is the best for chemical names, and that the discriminative application of string similarity methods to chemical and non-chemical names may be a simple but effective way to improve the performance of term clustering.","PeriodicalId":439926,"journal":{"name":"2011 10th International Conference on Machine Learning and Applications and Workshops","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121000152","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
Adaptive Profit Sharing Reinforcement Learning Method for Dynamic Environment 动态环境下的自适应利润分享强化学习方法
Sadamori Koujaku, Kota Watanabe, H. Igarashi
{"title":"Adaptive Profit Sharing Reinforcement Learning Method for Dynamic Environment","authors":"Sadamori Koujaku, Kota Watanabe, H. Igarashi","doi":"10.1109/ICMLA.2011.25","DOIUrl":"https://doi.org/10.1109/ICMLA.2011.25","url":null,"abstract":"In this paper, an Adaptive Forgettable Profit Sharing reinforcement learning method is introduced. This method enables agents to adapt the environmental changes very quickly. It can be used to learn the robust and effective actions in the uncertain environments which have the non-markov property, especially the partial observable markov process (POMDP). Profit Sharing learns rational policy that is easy to be learned and results in good behavior in POMDP. However, the policy becomes worse in the dynamic and huge environment that changes frequently and require the lots of actions to achieve the goal. In order to handle such kind of environment, the forgetting, which gives the adaptability and rationality to Profit Sharing, is implemented. This method allows the agent to forget past experiences that reduce the rationality of its policy. The usefulness of the proposed algorithm is demonstrated through the numerical examples.","PeriodicalId":439926,"journal":{"name":"2011 10th International Conference on Machine Learning and Applications and Workshops","volume":"143 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124849128","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
Classification of Patients Using Novel Multivariate Time Series Representations of Physiological Data 使用新的多变量时间序列表示生理数据的患者分类
Patricia Ordóñez, T. Armstrong, T. Oates, J. Fackler
{"title":"Classification of Patients Using Novel Multivariate Time Series Representations of Physiological Data","authors":"Patricia Ordóñez, T. Armstrong, T. Oates, J. Fackler","doi":"10.1109/ICMLA.2011.46","DOIUrl":"https://doi.org/10.1109/ICMLA.2011.46","url":null,"abstract":"In this paper we present two novel multivariate time series representations to classify physiological data of different lengths. The representations may be applied to any group of multivariate time series data that examine the state or health of an entity. Multivariate Bag-of-Patterns and Stacked Bags of-Patterns improve on their univariate counterpart, inspired by the bag-of-words model, by using multiple time series and analyzing the data in a multivariate fashion. We also borrow techniques from the natural language processing domain such as term frequency and inverse document frequency to improve classification accuracy. We introduce a technique named inverse frequency and present experimental results on classifying patients who have experienced acute episodes of hypotension.","PeriodicalId":439926,"journal":{"name":"2011 10th International Conference on Machine Learning and Applications and Workshops","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125094378","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
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学术文献互助群
群 号:481959085
Book学术官方微信