{"title":"A Hybrid \"Quantum and Classical\" Method for Outlier Detection","authors":"Rabah Mazouzi, P. Harel","doi":"10.1145/3384544.3384576","DOIUrl":null,"url":null,"abstract":"In this paper, we present a novel method for outlier detection based on a hybrid approach involving both quantum and classical computing. The proposed method proceeds according to two steps: The first step uses classical computing by preparing and initializing components for the second step involving quantum computing. The latter uses adapted versions of some well-referenced quantum algorithms such as the quantum calculation of Hamming distance, and the minimum finding of Durr-Hoyer. The proposed method is based on the calculation of the distance between the instance to be tested and its Kth nearest neighbor. The test instance is thus considered an outlier if the calculated distance is greater than a given threshold T. At the end of this paper, we present an experimentation of the method and a performance analysis showing a quadratic improvement in terms of computational complexity compared to classical methods of outlier detection.","PeriodicalId":200246,"journal":{"name":"Proceedings of the 2020 9th International Conference on Software and Computer Applications","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2020 9th International Conference on Software and Computer Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3384544.3384576","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
In this paper, we present a novel method for outlier detection based on a hybrid approach involving both quantum and classical computing. The proposed method proceeds according to two steps: The first step uses classical computing by preparing and initializing components for the second step involving quantum computing. The latter uses adapted versions of some well-referenced quantum algorithms such as the quantum calculation of Hamming distance, and the minimum finding of Durr-Hoyer. The proposed method is based on the calculation of the distance between the instance to be tested and its Kth nearest neighbor. The test instance is thus considered an outlier if the calculated distance is greater than a given threshold T. At the end of this paper, we present an experimentation of the method and a performance analysis showing a quadratic improvement in terms of computational complexity compared to classical methods of outlier detection.