2014 13th International Conference on Machine Learning and Applications最新文献

筛选
英文 中文
A Cyclic Contrastive Divergence Learning Algorithm for High-Order RBMs 一种高阶rbm的循环对比发散学习算法
2014 13th International Conference on Machine Learning and Applications Pub Date : 2014-12-03 DOI: 10.1109/ICMLA.2014.18
D. Luo, Yi Wang, Xiaoqiang Han, Xihong Wu
{"title":"A Cyclic Contrastive Divergence Learning Algorithm for High-Order RBMs","authors":"D. Luo, Yi Wang, Xiaoqiang Han, Xihong Wu","doi":"10.1109/ICMLA.2014.18","DOIUrl":"https://doi.org/10.1109/ICMLA.2014.18","url":null,"abstract":"The Restricted Boltzmann Machine (RBM), a special case of general Boltzmann Machines and a typical Probabilistic Graphical Models, has attracted much attention in recent years due to its powerful ability in extracting features and representing the distribution underlying the training data. A most commonly used algorithm in learning RBMs is called Contrastive Divergence (CD) proposed by Hinton, which starts a Markov chain at a data point and runs the chain for only a few iterations to get a low variance estimator. However, when referring to a high-order RBM, since there are interactions among its visible layers, the gradient approximation via CD learning usually becomes far from the log-likelihood gradient and even may cause CD learning to fall into an infinite loop with high reconstruction error. In this paper, a new algorithm named Cyclic Contrastive Divergence (CCD) is introduced for learning high-order RBMs. Unlike the standard CD algorithm, CCD updates the parameters according to each visible layer in turn, by borrowing the idea of Cyclic Block Coordinate Descent method. To evaluate the performance of the proposed CCD algorithm, regarding to high-order RBMs learning, both algorithms CCD and standard CD are theoretically analyzed, including convergence, estimate upper bound and both biases comparison, from which the superiority of CCD learning is revealed. Experiments on MNIST dataset for the handwritten digit classification task are performed. The experimental results show that CCD is more applicable and consistently outperforms the standard CD in both convergent speed and performance.","PeriodicalId":109606,"journal":{"name":"2014 13th International Conference on Machine Learning and Applications","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124084186","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
Activity Recognition Using Graphical Features 使用图形特征的活动识别
2014 13th International Conference on Machine Learning and Applications Pub Date : 2014-12-03 DOI: 10.1109/ICMLA.2014.31
S. Akter, L. Holder
{"title":"Activity Recognition Using Graphical Features","authors":"S. Akter, L. Holder","doi":"10.1109/ICMLA.2014.31","DOIUrl":"https://doi.org/10.1109/ICMLA.2014.31","url":null,"abstract":"Activity Recognition is important in order to facilitate elderly residents' and their caregivers' needs. This problem has been widely investigated using different methods including probabilistic and Markovian approaches. The focus of this paper is to perform activity recognition more accurately than existing approaches using non-intrusive sensors. We represent motion sensors of smart environments in a graph and resident's movements as edges in the graph. Then graph-based features are extracted and used as input for a Support Vector Machine. These features have been combined with motion-sensor based features. This method has been compared with three other widely used approaches, Naive Bayes, Hidden Markov Model (HMM) and Conditional Random Fields (CRF) on three different datasets from three smart apartments. In all cases, the method based on graphical features outperformed one of the state of the art methods for activity recognition.","PeriodicalId":109606,"journal":{"name":"2014 13th International Conference on Machine Learning and Applications","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128487568","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
TSD: Detecting Sybil Accounts in Twitter TSD:在Twitter上检测Sybil帐户
2014 13th International Conference on Machine Learning and Applications Pub Date : 2014-12-03 DOI: 10.1109/ICMLA.2014.81
Mansour Alsaleh, A. Alarifi, A. Al-Salman, Mohammed Alfayez, Abdulmajeed Almuhaysin
{"title":"TSD: Detecting Sybil Accounts in Twitter","authors":"Mansour Alsaleh, A. Alarifi, A. Al-Salman, Mohammed Alfayez, Abdulmajeed Almuhaysin","doi":"10.1109/ICMLA.2014.81","DOIUrl":"https://doi.org/10.1109/ICMLA.2014.81","url":null,"abstract":"Fake identities and user accounts (also called \"Sybils\") in online communities represent today a treasure for adversaries to spread fake product reviews, malware and spam on social networks, and Astroturf political campaigns. State-of-the-art in the defense mechanisms includes Automated Turing Tests (ATTs such as CAPTCHAs) and graph-based Sybil detectors. Sybil detectors in social networks leverage the assumption that Sybils will find it hard to befriend real users which leads to Sybils being connected to each other forming strongly connected sub graphs that can be detected using graph theory. However, the large majority of Sybils are in fact successful in integrating themselves into real user communities (such as the case in Twitter and Facebook). In this paper, we first study and compare the current detection mechanisms of Sybil accounts. We also explore various types of Twitter Sybil accounts detection features with the objective of building an effective and practical classifier. In order to build and evaluate our classifier, we collect and manually label a dataset of twitter accounts, including human users, bots, and hybrid (i.e., Tweets are posted by both human and bots). We believe this Twitter Sybils corpus will help researchers in conducting sound measurement studies. We also develop a browser plug-in (that we call Twitter Sybils Detector or TSD for short) that utilizes our classifier and warns the user about possible Sybil accounts before accessing them, upon clicking on a Twitter account.","PeriodicalId":109606,"journal":{"name":"2014 13th International Conference on Machine Learning and Applications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127809488","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}
引用次数: 50
Next Generation Application-Layer DDoS Defences: Applying the Concepts of Outlier Detection in Data Streams with Concept Drift 下一代应用层DDoS防御:在概念漂移数据流中应用离群检测的概念
2014 13th International Conference on Machine Learning and Applications Pub Date : 2014-12-03 DOI: 10.1109/ICMLA.2014.80
D. Stevanovic, N. Vlajic
{"title":"Next Generation Application-Layer DDoS Defences: Applying the Concepts of Outlier Detection in Data Streams with Concept Drift","authors":"D. Stevanovic, N. Vlajic","doi":"10.1109/ICMLA.2014.80","DOIUrl":"https://doi.org/10.1109/ICMLA.2014.80","url":null,"abstract":"The existing state-of-the art in the field of application-layer DDoS protection is generally designed, and thus effective, only for static Web-domains. To the best of our knowledge, this paper is the first one to study the problem of application-layer DDoS defense in Web-sites of dynamic content and/or organization and under non-trivial bot (i.e., Attack) behavior. The main contributions of the paper are threefold: 1) we provide a detailed taxonomy of the existing and next-generation application-layer HTTP-based DDoS attacks, 2) we discuss the relevance of a branch of data mining theory -- known as data streams with concept drift -- to the problem of application-layer DDoS defense in dynamic Web-domains, 3) we present the outline of our next-generation anti-DDoS system that is intended for dynamic Web-domains facing different sophisticated variants of application-layer DDoS attacks. The paper also includes some of our preliminary experimental results concerning the detection of malicious Web-users/sessions using the proposed system.","PeriodicalId":109606,"journal":{"name":"2014 13th International Conference on Machine Learning and Applications","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126505655","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}
引用次数: 18
A Clustering-Based Grouping Model for Enhancing Collaborative Learning 基于聚类的协同学习分组模型
2014 13th International Conference on Machine Learning and Applications Pub Date : 2014-12-03 DOI: 10.1109/ICMLA.2014.94
Yulei Pang, Feiya Xiao, Huaying Wang, Xiaozhen Xue
{"title":"A Clustering-Based Grouping Model for Enhancing Collaborative Learning","authors":"Yulei Pang, Feiya Xiao, Huaying Wang, Xiaozhen Xue","doi":"10.1109/ICMLA.2014.94","DOIUrl":"https://doi.org/10.1109/ICMLA.2014.94","url":null,"abstract":"Group work is widely used in tertiary institutions due to the considerable advantages of collaborative learning. Previous studies indicated that the group diversity had positive influence on the group work achievement. Therefore, how to achieve diversity within a group effectively and automatically is an interesting question. In this paper we propose a novel clustering-based grouping model. The proposed technique first employs balanced K-means algorithm to divide the students into several size-balanced clusters, such that the students within the same cluster are more similar (in some sense) to each other than to those in other clusters, then adopts one-sample-each-cluster strategy to construct the groups1. We evaluated the proposed technique based on two small-scale case studies. The result observed may indicate that the clustering-based grouping model is feasible and effective.","PeriodicalId":109606,"journal":{"name":"2014 13th International Conference on Machine Learning and Applications","volume":"776 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123130638","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}
引用次数: 22
Ensemble Statistical and Heuristic Models for Unsupervised Word Alignment 无监督词对齐的集成统计和启发式模型
2014 13th International Conference on Machine Learning and Applications Pub Date : 2014-12-03 DOI: 10.1109/ICMLA.2014.15
Mahsa Mohaghegh, Hossein Sarrafzadeh, M. Mohammadi
{"title":"Ensemble Statistical and Heuristic Models for Unsupervised Word Alignment","authors":"Mahsa Mohaghegh, Hossein Sarrafzadeh, M. Mohammadi","doi":"10.1109/ICMLA.2014.15","DOIUrl":"https://doi.org/10.1109/ICMLA.2014.15","url":null,"abstract":"Statistical word alignment models need large amounts of training data while they are weak in small-sized corpora. This paper proposes a new approach of an unsupervised hybrid word alignment technique using an ensemble learning method. This algorithm uses three base alignment models in several rounds to generate alignments. The ensemble algorithm uses a weighed scheme for resampling training data and a voting score to consider aggregated alignments. The underlying alignment algorithms used in this study include IBM Model 1, 2 and a heuristic method based on Dice measurement. Our experimental results show that by this approach, the alignment error rate could be improved by at least 15% for the base alignment models.","PeriodicalId":109606,"journal":{"name":"2014 13th International Conference on Machine Learning and Applications","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131076467","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
Semi-supervised Kernel-Based Temporal Clustering 半监督核时间聚类
2014 13th International Conference on Machine Learning and Applications Pub Date : 2014-12-03 DOI: 10.1109/ICMLA.2014.25
Rodrigo Araujo, M. Kamel
{"title":"Semi-supervised Kernel-Based Temporal Clustering","authors":"Rodrigo Araujo, M. Kamel","doi":"10.1109/ICMLA.2014.25","DOIUrl":"https://doi.org/10.1109/ICMLA.2014.25","url":null,"abstract":"In this paper, we adapt two existing methods to perform semi-supervised temporal clustering: Aligned Cluster Analysis (ACA), a temporal clustering algorithm, and Constrained Spectral Clustering, a semi-supervised clustering algorithm. In the first method, we add side information in the form of pair wise constraints to its objective function, and in the second, we add a temporal search to its framework. We also extend both methods by propagating the constraints throughout the whole similarity matrix. In order to validate the advantage of the proposed semi-supervised methods to temporal clustering, we evaluate them in comparison to their original versions as well as another semi-supervised temporal cluster on three temporal datasets. The results show that the proposed methods are competitive and provide good improvement over the unsupervised approaches.","PeriodicalId":109606,"journal":{"name":"2014 13th International Conference on Machine Learning and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122413782","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
State Abstraction in Reinforcement Learning by Eliminating Useless Dimensions 消除无用维度强化学习中的状态抽象
2014 13th International Conference on Machine Learning and Applications Pub Date : 2014-12-03 DOI: 10.1109/ICMLA.2014.22
Zhao Cheng, L. Ray
{"title":"State Abstraction in Reinforcement Learning by Eliminating Useless Dimensions","authors":"Zhao Cheng, L. Ray","doi":"10.1109/ICMLA.2014.22","DOIUrl":"https://doi.org/10.1109/ICMLA.2014.22","url":null,"abstract":"Q-learning and other linear dynamic learning algorithms are subject to Bellman's curse of dimensionality for any realistic learning problem. This paper introduces a framework for satisficing state abstraction -- one that reduces state dimensionality, improving convergence and reducing computational and memory resources -- by eliminating useless state dimensions. Statistical parameters that are dependent on the state and Q-values identify the relevance of a given state space to a task space and allow state elements that contribute least to task learning to be discarded. Empirical results of applying state abstraction to a canonical single-agent path planning task and to a more difficult multi-agent foraging problem demonstrate utility of the proposed methods in improving learning convergence and performance in resource-constrained learning problems.","PeriodicalId":109606,"journal":{"name":"2014 13th International Conference on Machine Learning and Applications","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122485397","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
Computation of a Rejection Threshold Used for the Bayes Classifier 贝叶斯分类器拒绝阈值的计算
2014 13th International Conference on Machine Learning and Applications Pub Date : 2014-12-03 DOI: 10.1109/ICMLA.2014.61
M. Blankenburg, Christian Bloch, Jörg Krüger
{"title":"Computation of a Rejection Threshold Used for the Bayes Classifier","authors":"M. Blankenburg, Christian Bloch, Jörg Krüger","doi":"10.1109/ICMLA.2014.61","DOIUrl":"https://doi.org/10.1109/ICMLA.2014.61","url":null,"abstract":"In this paper an algorithm for the efficient computation of a rejection threshold for Bayes classification is discussed. A theoretical and a practical evaluation of the performance regarding the accuracy of the numerical computation for uni- and multimodal high-dimensional probability distributions is given. Additionally some observations regarding the dimensionality and the number of samples are shared.","PeriodicalId":109606,"journal":{"name":"2014 13th International Conference on Machine Learning and Applications","volume":"49 15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131470424","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
Combining Exact and Metaheuristic Techniques for Learning Extended Finite-State Machines from Test Scenarios and Temporal Properties 结合精确和元启发式技术从测试场景和时间属性中学习扩展有限状态机
2014 13th International Conference on Machine Learning and Applications Pub Date : 2014-12-03 DOI: 10.1109/ICMLA.2014.62
D. Chivilikhin, V. Ulyantsev, A. Shalyto
{"title":"Combining Exact and Metaheuristic Techniques for Learning Extended Finite-State Machines from Test Scenarios and Temporal Properties","authors":"D. Chivilikhin, V. Ulyantsev, A. Shalyto","doi":"10.1109/ICMLA.2014.62","DOIUrl":"https://doi.org/10.1109/ICMLA.2014.62","url":null,"abstract":"This paper addresses the problem of learning extended finite-state machines (EFSMs) from user-specified behavior examples (test scenarios) and temporal properties. We show how to combine exact EFSM inference algorithms (that always find a solution if it exists) and metaheuristics to derive an efficient combined EFSM learning algorithm. We also present a new exact EFSM inference algorithm based on Constraint Satisfaction Problem (CSP) solvers. Experimental results are reported showing that the new combined algorithm significantly outperforms a previously used metaheuristic.","PeriodicalId":109606,"journal":{"name":"2014 13th International Conference on Machine Learning and Applications","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116942564","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学术文献互助群
群 号:604180095
Book学术官方微信