2012 IEEE International Workshop on Machine Learning for Signal Processing最新文献

筛选
英文 中文
On the performance of histogram-based entropy estimators 基于直方图熵估计器的性能研究
2012 IEEE International Workshop on Machine Learning for Signal Processing Pub Date : 2012-11-12 DOI: 10.1109/MLSP.2012.6349727
C. Giurcăneanu, Panu Luosto, P. Kontkanen
{"title":"On the performance of histogram-based entropy estimators","authors":"C. Giurcăneanu, Panu Luosto, P. Kontkanen","doi":"10.1109/MLSP.2012.6349727","DOIUrl":"https://doi.org/10.1109/MLSP.2012.6349727","url":null,"abstract":"Histograms are widely used for estimating the density of a continuous signal from existing data. In some practical applications, they are also employed for entropy estimation. However, a histogram involves implicitly a discretization procedure because the unknown density is approximated by a piecewise constant density model. In the previous literature, the impact of the discretization procedure on the accuracy of the entropy estimate was either ignored or evaluated in the particular case of a regular histogram, in which all bins are equally wide. In this work, we provide bounds on the performance of the histogram-based entropy estimators without relying on the restrictive assumptions which have been used by other authors. The proof of our theoretical results is mainly based on concentration inequalities which have been already employed to analyze the performance of histograms as density estimators. After establishing the theoretical results, we illustrate them by numerical examples.","PeriodicalId":262601,"journal":{"name":"2012 IEEE International Workshop on Machine Learning for Signal Processing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126694165","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
Sequential anomaly detection in a batch with growing number of tests: Application to network intrusion detection 具有越来越多测试的批处理顺序异常检测:在网络入侵检测中的应用
2012 IEEE International Workshop on Machine Learning for Signal Processing Pub Date : 2012-11-12 DOI: 10.1109/MLSP.2012.6349793
David J. Miller, Fatih Kocak, G. Kesidis
{"title":"Sequential anomaly detection in a batch with growing number of tests: Application to network intrusion detection","authors":"David J. Miller, Fatih Kocak, G. Kesidis","doi":"10.1109/MLSP.2012.6349793","DOIUrl":"https://doi.org/10.1109/MLSP.2012.6349793","url":null,"abstract":"For high (N)-dimensional feature spaces, we consider detection of an unknown, anomalous class of samples amongst a batch of collected samples (of size T), under the null hypothesis that all samples follow the same probability law. Since the features which will best identify the anomalies are a priori unknown, several common detection strategies are: 1) evaluating atypicality of a sample (its p-value) based on the null distribution defined on the full N-dimensional feature space; 2) considering a (combinatoric) set of low order distributions, e.g. all singletons and all feature pairs, with detections made based on the smallest p-value yielded over all such low order tests. The first approach relies on accurate estimation of the joint distribution, while the second may suffer from increased false alarm rates as N and T grow. Alternatively, inspired by greedy feature selection commonly used in supervised learning, we propose a novel sequential anomaly detection procedure with a growing number of tests. Here, new tests are (greedily) included only when they are needed, i.e., when their use (on currently undetected samples) will yield greater aggregate statistical significance of (multiple testing corrected) detections than obtainable using the existing test cadre. Our approach thus aims to maximize aggregate statistical significance of all detections made up until a finite horizon. Our method is evaluated, along with supervised methods, for a network intrusion domain, detecting Zeus bot (intrusion) packet flows embedded amongst (normal)Web flows. It is shown that judicious feature representation is essential for discriminating Zeus from Web.","PeriodicalId":262601,"journal":{"name":"2012 IEEE International Workshop on Machine Learning for Signal Processing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128018012","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 comparing hard and soft fusion of dependent detectors 依赖探测器硬、软聚变的比较
2012 IEEE International Workshop on Machine Learning for Signal Processing Pub Date : 2012-11-12 DOI: 10.1109/MLSP.2012.6349792
A. Soriano, L. Vergara, G. Safont, A. Salazar
{"title":"On comparing hard and soft fusion of dependent detectors","authors":"A. Soriano, L. Vergara, G. Safont, A. Salazar","doi":"10.1109/MLSP.2012.6349792","DOIUrl":"https://doi.org/10.1109/MLSP.2012.6349792","url":null,"abstract":"A detection problem, where we have a set of two types of different measurements or modalities of one event, is considered. The optimal fusion rule to combine both modalities in one detector needs the knowledge of the joint statistics of modalities. In many cases we do not know these joint statistics and it is usual to consider independence between modalities for implementing a suboptimal fusion rule. Another suboptimum alternative not much used is to make hard fusion, that is, to thresholding every modality to obtain a set of binary decisions to be fused in only on final decision. In some situations, we can obtain better results using hard fusion instead of soft fusion under the independence assumption. The goal of this paper is to show that the later sentence is generally true.","PeriodicalId":262601,"journal":{"name":"2012 IEEE International Workshop on Machine Learning for Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130166271","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
Temporal context in object recognition 对象识别中的时间背景
2012 IEEE International Workshop on Machine Learning for Signal Processing Pub Date : 2012-11-12 DOI: 10.1109/MLSP.2012.6349758
R. Chalasani, J. Príncipe
{"title":"Temporal context in object recognition","authors":"R. Chalasani, J. Príncipe","doi":"10.1109/MLSP.2012.6349758","DOIUrl":"https://doi.org/10.1109/MLSP.2012.6349758","url":null,"abstract":"Sparse coding has become a popular way to learn feature representation from the data itself. However, temporal context, when present, can provide useful information and alleviate instability in sparse representation. Here we show that when sparse coding is used in conjunction with a dynamical system, the extracted features can provide better descriptors for time-varying observations. We show a marked improvement in classification performance on COIL-100 and animal datasets using our model. We also propose a simple extension to our model to learn invariant representations.","PeriodicalId":262601,"journal":{"name":"2012 IEEE International Workshop on Machine Learning for Signal Processing","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132461742","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
GLRT for testing separability of a complex-valued mixture based on the Strong Uncorrelating Transform 基于强不相关变换的复值混合物可分性检测
2012 IEEE International Workshop on Machine Learning for Signal Processing Pub Date : 2012-11-12 DOI: 10.1109/MLSP.2012.6349785
D. Ramírez, P. Schreier, J. Vía, I. Santamaría
{"title":"GLRT for testing separability of a complex-valued mixture based on the Strong Uncorrelating Transform","authors":"D. Ramírez, P. Schreier, J. Vía, I. Santamaría","doi":"10.1109/MLSP.2012.6349785","DOIUrl":"https://doi.org/10.1109/MLSP.2012.6349785","url":null,"abstract":"The Strong Uncorrelating Transform (SUT) allows blind separation of a mixture of complex independent sources if and only if all sources have distinct circularity coefficients. In practice, the circularity coefficients need to be estimated from observed data. We propose a generalized likelihood ratio test (GLRT) for separability of a complex mixture using the SUT, based on estimated circularity coefficients. For distinct circularity coefficients (separable case), the maximum likelihood (ML) estimates, required for the GLRT, are straightforward. However, for circularity coefficients with multiplicity larger than one (non-separable case), the ML estimates are much more difficult to find. Numerical simulations show the good performance of the proposed detector.","PeriodicalId":262601,"journal":{"name":"2012 IEEE International Workshop on Machine Learning for Signal Processing","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132038039","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
ESWT - tracking organs during focused ultrasound surgery 聚焦超声手术中ESWT跟踪器官
2012 IEEE International Workshop on Machine Learning for Signal Processing Pub Date : 2012-11-12 DOI: 10.1109/MLSP.2012.6349746
C. Grozea, D. Lübke, Felix Dingeldey, M. Schiewe, J. Gerhardt, C. Schumann, J. Hirsch
{"title":"ESWT - tracking organs during focused ultrasound surgery","authors":"C. Grozea, D. Lübke, Felix Dingeldey, M. Schiewe, J. Gerhardt, C. Schumann, J. Hirsch","doi":"10.1109/MLSP.2012.6349746","DOIUrl":"https://doi.org/10.1109/MLSP.2012.6349746","url":null,"abstract":"We report here our results in a multi-sensor setup reproducing the conditions of an automated focused ultrasound surgery environment. The aim is to continuously predict the position of an internal organ (here the liver) under guided and non-guided free breathing, with the accuracy required by surgery. We have performed experiments with 16 healthy human subjects, two of those taking part in full-scale experiments involving a 3 Tesla MRI machine recording a volume containing the liver. For the other 14 subjects we have used the optical tracker as a surrogate target. All subjects where volunteers who agreed to participate in the experiments after being thoroughly informed about it. For the MRI sessions we have analyzed semi-automatically offline the images in order to obtain the ground truth, the true position of the selected feature of the liver. The results we have obtained with continuously updated random forest models are very promising, we have obtained good prediction-target correlation coefficients for the surrogate targets (0.71 ± 0.1) and excellent for the real targets in the MRI experiments (over 0.91), despite being limited to a lower model update frequency, once every 6.16 seconds.","PeriodicalId":262601,"journal":{"name":"2012 IEEE International Workshop on Machine Learning for Signal Processing","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132508093","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
Nearest neighbor-based importance weighting 基于最近邻的重要性加权
2012 IEEE International Workshop on Machine Learning for Signal Processing Pub Date : 2012-11-12 DOI: 10.1109/MLSP.2012.6349714
M. Loog
{"title":"Nearest neighbor-based importance weighting","authors":"M. Loog","doi":"10.1109/MLSP.2012.6349714","DOIUrl":"https://doi.org/10.1109/MLSP.2012.6349714","url":null,"abstract":"Importance weighting is widely applicable in machine learning in general and in techniques dealing with data co-variate shift problems in particular. A novel, direct approach to determine such importance weighting is presented. It relies on a nearest neighbor classification scheme and is relatively straightforward to implement. Comparative experiments on various classification tasks demonstrate the effectiveness of our so-called nearest neighbor weighting (NNeW) scheme. Considering its performance, our procedure can act as a simple and effective baseline method for importance weighting.","PeriodicalId":262601,"journal":{"name":"2012 IEEE International Workshop on Machine Learning for Signal Processing","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131729409","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}
引用次数: 31
The eighth annual MLSP competition: First place team 第八届MLSP年度大赛:第一名队伍
2012 IEEE International Workshop on Machine Learning for Signal Processing Pub Date : 2012-11-12 DOI: 10.1109/MLSP.2012.6349771
Ankit Gupta, Shashwati Mishra, A. Mukerjee
{"title":"The eighth annual MLSP competition: First place team","authors":"Ankit Gupta, Shashwati Mishra, A. Mukerjee","doi":"10.1109/MLSP.2012.6349771","DOIUrl":"https://doi.org/10.1109/MLSP.2012.6349771","url":null,"abstract":"Our basic strategy is to examine the spatial neighborhood of the point, P, for its classification. Each point Q in P's neighborhood contributes a binary vote. The sum of these votes, VP, is compared against a threshold τ and access is granted if the value VP is greater than the threshold.","PeriodicalId":262601,"journal":{"name":"2012 IEEE International Workshop on Machine Learning for Signal Processing","volume":"383 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126971819","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
Semisupervised kernel orthonormalized partial least squares 半监督核正则化偏最小二乘
2012 IEEE International Workshop on Machine Learning for Signal Processing Pub Date : 2012-11-12 DOI: 10.1109/MLSP.2012.6349718
E. Izquierdo-Verdiguier, J. Arenas-García, Sergio Muñoz-Romero, L. Gómez-Chova, Gustau Camps-Valls
{"title":"Semisupervised kernel orthonormalized partial least squares","authors":"E. Izquierdo-Verdiguier, J. Arenas-García, Sergio Muñoz-Romero, L. Gómez-Chova, Gustau Camps-Valls","doi":"10.1109/MLSP.2012.6349718","DOIUrl":"https://doi.org/10.1109/MLSP.2012.6349718","url":null,"abstract":"This paper presents a semisupervised kernel orthonormalized partial least squares (SS-KOPLS) algorithm for non-linear feature extraction. The proposed method finds projections that minimize the least squares regression error in Hilbert spaces and incorporates the wealth of unlabeled information to deal with small size labeled datasets. The method relies on combining a standard RBF kernel using labeled information, and a generative kernel learned by clustering all available data. The positive definiteness of the kernels is proven, and the structure and information content of the derived kernels is studied. The effectiveness of the proposed method is successfully illustrated in standard UCI database classification, Olivetti face database manifold learning, and in high-dimensional hyperspectral satellite image segmentation. High accuracy gains are obtained over KPLS in terms of expressive power of the extracted non-linear features. Matlab code is available at http://isp.uv.es for the interested readers.","PeriodicalId":262601,"journal":{"name":"2012 IEEE International Workshop on Machine Learning for Signal Processing","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133155106","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
Learning smooth models of nonsmooth functions via convex optimization 通过凸优化学习非光滑函数的光滑模型
2012 IEEE International Workshop on Machine Learning for Signal Processing Pub Date : 2012-11-12 DOI: 10.1109/MLSP.2012.6349755
Fabien Lauer, Van Luong Le, G. Bloch
{"title":"Learning smooth models of nonsmooth functions via convex optimization","authors":"Fabien Lauer, Van Luong Le, G. Bloch","doi":"10.1109/MLSP.2012.6349755","DOIUrl":"https://doi.org/10.1109/MLSP.2012.6349755","url":null,"abstract":"This paper proposes a learning framework and a set of algorithms for nonsmooth regression, i.e., for learning piecewise smooth target functions with discontinuities in the function itself or the derivatives at unknown locations. In the proposed approach, the model belongs to a class of smooth functions. Though constrained to be globally smooth, the trained model can have very large derivatives at particular locations to approximate the nonsmoothness of the target function. This is obtained through the definition of new regularization terms which penalize the derivatives in a location-dependent manner and training algorithms in the form of convex optimization problems. Examples of application to hybrid dynamical system identification and image reconstruction are provided.","PeriodicalId":262601,"journal":{"name":"2012 IEEE International Workshop on Machine Learning for Signal Processing","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114878101","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
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学术官方微信