<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>1837</id>
    <completedYear>2021</completedYear>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>108</pageFirst>
    <pageLast>115</pageLast>
    <pageNumber>8</pageNumber>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Recurrence Plot Spacial Pyramid Pooling Network for Appliance Identification in Non-Intrusive Load Monitoring</title>
    <abstract language="eng">Parameter free Non-intrusive Load Monitoring (NILM) algorithms are a major step toward real-world NILM scenarios. The identification of appliances is the key element in NILM. The task consists of identification of the appliance category and its current state. In this paper, we present a param- eter free appliance identification algorithm for NILM using a 2D representation of time series known as unthresholded Recurrence Plots (RP) for appliance category identification. One cycle of voltage and current (V-I trajectory) are transformed into a RP and classified using a Spacial Pyramid Pooling Convolutional Neural Network architecture. The performance of our approach is evaluated on the three public datasets COOLL, PLAID and WHITEDv1.1 and compared to previous publications. We show that compared to other approaches using our architecture no initial parameters have to be manually tuned for each specific dataset.</abstract>
    <parentTitle language="eng">2021 20th IEEE International Conference on Machine Learning and Applications (ICMLA)</parentTitle>
    <identifier type="url">https://doi.org/10.1109/ICMLA52953.2021.00025</identifier>
    <enrichment key="PeerReviewed">Ja</enrichment>
    <enrichment key="RS_Correlation">Ja</enrichment>
    <enrichment key="opus.source">publish</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">true</enrichment>
    <author>Marc Wenninger</author>
    <author>Sebastian P. Bayerl</author>
    <author>Andreas Maier</author>
    <author>Jochen Schmidt</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>NILM</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>V-I trajectory</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Recurrence Plot</value>
    </subject>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="institutes" number="">Fakultät für Informatik</collection>
    <thesisPublisher>Technische Hochschule Rosenheim</thesisPublisher>
  </doc>
</export-example>
