Information geometry最新文献_第3页

Differential geometry for the optimal design of the contingent valuation method 微分几何中用于优化设计的条件估值方法

Information geometry Pub Date : 2023-05-31 DOI: 10.1007/s41884-023-00109-w

Hisatoshi Tanaka

引用次数: 0

Anomaly detection in the probability simplex under different geometries 不同几何形状下概率单纯形的异常检测

Information geometry Pub Date : 2023-05-30 DOI: 10.1007/s41884-023-00107-y

Uriel Legaria, Sergio Mota, Sergio Martinez, Alfredo Cobá, Argenis Chable, Antonio Neme

{"title":"Anomaly detection in the probability simplex under different geometries","authors":"Uriel Legaria, Sergio Mota, Sergio Martinez, Alfredo Cobá, Argenis Chable, Antonio Neme","doi":"10.1007/s41884-023-00107-y","DOIUrl":"https://doi.org/10.1007/s41884-023-00107-y","url":null,"abstract":"Abstract An open problem in data science is that of anomaly detection. Anomalies are instances that do not maintain a certain property that is present in the remaining observations in a dataset. Several anomaly detection algorithms exist, since the process itself is ill-posed mainly because the criteria that separates common or expected vectors from anomalies are not unique. In the most extreme case, data is not labelled and the algorithm has to identify the vectors that are anomalous, or assign a degree of anomaly to each vector. The majority of anomaly detection algorithms do not make any assumptions about the properties of the feature space in which observations are embedded, which may affect the results when those spaces present certain properties. For instance, compositional data such as normalized histograms, that can be embedded in a probability simplex, constitute a particularly relevant case. In this contribution, we address the problem of detecting anomalies in the probability simplex, relying on concepts from Information Geometry, mainly by focusing our efforts in the distance functions commonly applied in that context. We report the results of a series of experiments and conclude that when a specific distance-based anomaly detection algorithm relies on Information Geometry-related distance functions instead of the Euclidean distance, the performance is significantly improved.","PeriodicalId":93762,"journal":{"name":"Information geometry","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135693124","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 parameterisation-invariant modification of the score test 分数测试的参数化不变修改

Information geometry Pub Date : 2023-03-07 DOI: 10.1007/s41884-023-00101-4

P. Jupp

引用次数: 0

Non-negative low-rank approximations for multi-dimensional arrays on statistical manifold 统计流形上多维数组的非负低秩近似

Information geometry Pub Date : 2023-02-24 DOI: 10.1007/s41884-023-00100-5

Kazu Ghalamkari, M. Sugiyama

引用次数: 1

Coarse geometric kernels for networks embedding 网络嵌入的粗几何核

Information geometry Pub Date : 2023-01-26 DOI: 10.1007/s41884-022-00095-5

Emil Saucan, Vladislav Barkanass, J. Jost