Loading…
Anytime algorithm for frequent pattern outlier detection
Outlier detection consists in detecting anomalous observations from data. During the past decade, outlier detection methods were proposed using the concept of frequent patterns. Basically such methods require to mine all frequent patterns for computing the outlier factor of each transaction. This ap...
Saved in:
Published in: | International journal of data science and analytics 2016-12, Vol.2 (3-4), p.119-130 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | cdi_FETCH-LOGICAL-c2809-750f03ae46b28ae5a222ec9cdb89312c194c1393b3260217062374190d0887063 |
---|---|
cites | cdi_FETCH-LOGICAL-c2809-750f03ae46b28ae5a222ec9cdb89312c194c1393b3260217062374190d0887063 |
container_end_page | 130 |
container_issue | 3-4 |
container_start_page | 119 |
container_title | International journal of data science and analytics |
container_volume | 2 |
creator | Giacometti, Arnaud Soulet, Arnaud |
description | Outlier detection consists in detecting anomalous observations from data. During the past decade, outlier detection methods were proposed using the concept of frequent patterns. Basically such methods require to mine all frequent patterns for computing the outlier factor of each transaction. This approach remains too expensive despite recent progress in pattern mining field to provide results within a short response time of only a few seconds. In this paper, we provide the first
anytime
method for calculating the frequent pattern outlier factor (FPOF). This method which can be interrupted at anytime by the end-user accurately approximates FPOF by mining a sample of patterns. It also computes the maximum error on the estimated FPOF for helping the user to stop the process at the right time. Experiments show the interest of this method for very large datasets where exhaustive mining fails to provide good approximate solutions. The accuracy of our anytime approximate method outperforms the baseline approach for a same budget in number of patterns. |
doi_str_mv | 10.1007/s41060-016-0019-9 |
format | article |
fullrecord | <record><control><sourceid>crossref_sprin</sourceid><recordid>TN_cdi_crossref_primary_10_1007_s41060_016_0019_9</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_1007_s41060_016_0019_9</sourcerecordid><originalsourceid>FETCH-LOGICAL-c2809-750f03ae46b28ae5a222ec9cdb89312c194c1393b3260217062374190d0887063</originalsourceid><addsrcrecordid>eNp9j8tqwzAQRUVpoSHNB3TnH1A7I9mytAyhLwh000J3QpbHqYMfqSQv8vd1SOkyq7kD9wxzGLtHeECA8jHmCAo4oOIAaLi5YgshVc5zVPr6Pxdft2wV4x7mUqlkofSC6fVwTG1Pmet2Y2jTd581Y8iaQD8TDSk7uJQoDNk4pa6lkNWUyKd2HO7YTeO6SKu_uWSfz08fm1e-fX9526y33AsNhpcFNCAd5aoS2lHhhBDkja8rbSQKjyb3KI2spFAgsAQlZJmjgRq0nje5ZHi-68MYY6DGHkLbu3C0CPZkb8_2dra3J3trZkacmTh3hx0Fux-nMMxvXoB-AaVsW0A</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Anytime algorithm for frequent pattern outlier detection</title><source>Springer Link</source><creator>Giacometti, Arnaud ; Soulet, Arnaud</creator><creatorcontrib>Giacometti, Arnaud ; Soulet, Arnaud</creatorcontrib><description>Outlier detection consists in detecting anomalous observations from data. During the past decade, outlier detection methods were proposed using the concept of frequent patterns. Basically such methods require to mine all frequent patterns for computing the outlier factor of each transaction. This approach remains too expensive despite recent progress in pattern mining field to provide results within a short response time of only a few seconds. In this paper, we provide the first
anytime
method for calculating the frequent pattern outlier factor (FPOF). This method which can be interrupted at anytime by the end-user accurately approximates FPOF by mining a sample of patterns. It also computes the maximum error on the estimated FPOF for helping the user to stop the process at the right time. Experiments show the interest of this method for very large datasets where exhaustive mining fails to provide good approximate solutions. The accuracy of our anytime approximate method outperforms the baseline approach for a same budget in number of patterns.</description><identifier>ISSN: 2364-415X</identifier><identifier>EISSN: 2364-4168</identifier><identifier>DOI: 10.1007/s41060-016-0019-9</identifier><language>eng</language><publisher>Cham: Springer International Publishing</publisher><subject>Artificial Intelligence ; Business Information Systems ; Computational Biology/Bioinformatics ; Computer Science ; Data Mining and Knowledge Discovery ; Database Management ; Regular Paper</subject><ispartof>International journal of data science and analytics, 2016-12, Vol.2 (3-4), p.119-130</ispartof><rights>Springer International Publishing Switzerland 2016</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c2809-750f03ae46b28ae5a222ec9cdb89312c194c1393b3260217062374190d0887063</citedby><cites>FETCH-LOGICAL-c2809-750f03ae46b28ae5a222ec9cdb89312c194c1393b3260217062374190d0887063</cites><orcidid>0000-0001-8335-6069</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27923,27924</link.rule.ids></links><search><creatorcontrib>Giacometti, Arnaud</creatorcontrib><creatorcontrib>Soulet, Arnaud</creatorcontrib><title>Anytime algorithm for frequent pattern outlier detection</title><title>International journal of data science and analytics</title><addtitle>Int J Data Sci Anal</addtitle><description>Outlier detection consists in detecting anomalous observations from data. During the past decade, outlier detection methods were proposed using the concept of frequent patterns. Basically such methods require to mine all frequent patterns for computing the outlier factor of each transaction. This approach remains too expensive despite recent progress in pattern mining field to provide results within a short response time of only a few seconds. In this paper, we provide the first
anytime
method for calculating the frequent pattern outlier factor (FPOF). This method which can be interrupted at anytime by the end-user accurately approximates FPOF by mining a sample of patterns. It also computes the maximum error on the estimated FPOF for helping the user to stop the process at the right time. Experiments show the interest of this method for very large datasets where exhaustive mining fails to provide good approximate solutions. The accuracy of our anytime approximate method outperforms the baseline approach for a same budget in number of patterns.</description><subject>Artificial Intelligence</subject><subject>Business Information Systems</subject><subject>Computational Biology/Bioinformatics</subject><subject>Computer Science</subject><subject>Data Mining and Knowledge Discovery</subject><subject>Database Management</subject><subject>Regular Paper</subject><issn>2364-415X</issn><issn>2364-4168</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><recordid>eNp9j8tqwzAQRUVpoSHNB3TnH1A7I9mytAyhLwh000J3QpbHqYMfqSQv8vd1SOkyq7kD9wxzGLtHeECA8jHmCAo4oOIAaLi5YgshVc5zVPr6Pxdft2wV4x7mUqlkofSC6fVwTG1Pmet2Y2jTd581Y8iaQD8TDSk7uJQoDNk4pa6lkNWUyKd2HO7YTeO6SKu_uWSfz08fm1e-fX9526y33AsNhpcFNCAd5aoS2lHhhBDkja8rbSQKjyb3KI2spFAgsAQlZJmjgRq0nje5ZHi-68MYY6DGHkLbu3C0CPZkb8_2dra3J3trZkacmTh3hx0Fux-nMMxvXoB-AaVsW0A</recordid><startdate>20161201</startdate><enddate>20161201</enddate><creator>Giacometti, Arnaud</creator><creator>Soulet, Arnaud</creator><general>Springer International Publishing</general><scope>AAYXX</scope><scope>CITATION</scope><orcidid>https://orcid.org/0000-0001-8335-6069</orcidid></search><sort><creationdate>20161201</creationdate><title>Anytime algorithm for frequent pattern outlier detection</title><author>Giacometti, Arnaud ; Soulet, Arnaud</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c2809-750f03ae46b28ae5a222ec9cdb89312c194c1393b3260217062374190d0887063</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Artificial Intelligence</topic><topic>Business Information Systems</topic><topic>Computational Biology/Bioinformatics</topic><topic>Computer Science</topic><topic>Data Mining and Knowledge Discovery</topic><topic>Database Management</topic><topic>Regular Paper</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Giacometti, Arnaud</creatorcontrib><creatorcontrib>Soulet, Arnaud</creatorcontrib><collection>CrossRef</collection><jtitle>International journal of data science and analytics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Giacometti, Arnaud</au><au>Soulet, Arnaud</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Anytime algorithm for frequent pattern outlier detection</atitle><jtitle>International journal of data science and analytics</jtitle><stitle>Int J Data Sci Anal</stitle><date>2016-12-01</date><risdate>2016</risdate><volume>2</volume><issue>3-4</issue><spage>119</spage><epage>130</epage><pages>119-130</pages><issn>2364-415X</issn><eissn>2364-4168</eissn><abstract>Outlier detection consists in detecting anomalous observations from data. During the past decade, outlier detection methods were proposed using the concept of frequent patterns. Basically such methods require to mine all frequent patterns for computing the outlier factor of each transaction. This approach remains too expensive despite recent progress in pattern mining field to provide results within a short response time of only a few seconds. In this paper, we provide the first
anytime
method for calculating the frequent pattern outlier factor (FPOF). This method which can be interrupted at anytime by the end-user accurately approximates FPOF by mining a sample of patterns. It also computes the maximum error on the estimated FPOF for helping the user to stop the process at the right time. Experiments show the interest of this method for very large datasets where exhaustive mining fails to provide good approximate solutions. The accuracy of our anytime approximate method outperforms the baseline approach for a same budget in number of patterns.</abstract><cop>Cham</cop><pub>Springer International Publishing</pub><doi>10.1007/s41060-016-0019-9</doi><tpages>12</tpages><orcidid>https://orcid.org/0000-0001-8335-6069</orcidid><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 2364-415X |
ispartof | International journal of data science and analytics, 2016-12, Vol.2 (3-4), p.119-130 |
issn | 2364-415X 2364-4168 |
language | eng |
recordid | cdi_crossref_primary_10_1007_s41060_016_0019_9 |
source | Springer Link |
subjects | Artificial Intelligence Business Information Systems Computational Biology/Bioinformatics Computer Science Data Mining and Knowledge Discovery Database Management Regular Paper |
title | Anytime algorithm for frequent pattern outlier detection |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-12T10%3A48%3A42IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Anytime%20algorithm%20for%20frequent%20pattern%20outlier%20detection&rft.jtitle=International%20journal%20of%20data%20science%20and%20analytics&rft.au=Giacometti,%20Arnaud&rft.date=2016-12-01&rft.volume=2&rft.issue=3-4&rft.spage=119&rft.epage=130&rft.pages=119-130&rft.issn=2364-415X&rft.eissn=2364-4168&rft_id=info:doi/10.1007/s41060-016-0019-9&rft_dat=%3Ccrossref_sprin%3E10_1007_s41060_016_0019_9%3C/crossref_sprin%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c2809-750f03ae46b28ae5a222ec9cdb89312c194c1393b3260217062374190d0887063%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |