<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-05-31T00:11:03Z</responseDate><request verb="GetRecord" identifier="oai:riubu.ubu.es:10259/6635" metadataPrefix="edm">https://riubu.ubu.es/oai/request</request><GetRecord><record><header><identifier>oai:riubu.ubu.es:10259/6635</identifier><datestamp>2022-12-19T09:57:05Z</datestamp><setSpec>com_10259_3847</setSpec><setSpec>com_10259_5086</setSpec><setSpec>com_10259_2604</setSpec><setSpec>col_10259_3848</setSpec></header><metadata><rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:ore="http://www.openarchives.org/ore/terms/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:ds="http://dspace.org/ds/elements/1.1/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:edm="http://www.europeana.eu/schemas/edm/" xsi:schemaLocation="http://www.w3.org/1999/02/22-rdf-syntax-ns# http://www.europeana.eu/schemas/edm/EDM.xsd">
<edm:ProvidedCHO rdf:about="http://hdl.handle.net/10259/6635">
<dc:creator>Quintián, Héctor</dc:creator>
<dc:creator>Jove, Esteban</dc:creator>
<dc:creator>Casteleiro-Roca, José-Luis</dc:creator>
<dc:creator>Urda Muñoz, Daniel</dc:creator>
<dc:creator>Arroyo Puente, Ángel</dc:creator>
<dc:creator>Calvo-Rolle, José Luis</dc:creator>
<dc:creator>Herrero Cosío, Álvaro</dc:creator>
<dc:creator>Corchado, Emilio</dc:creator>
<dc:date>2022-12</dc:date>
<dc:description>Detecting intrusions in large networks is a highly demanding task. In order to reduce the computation demand of analysing every single packet travelling along one of such networks, some years ago flows were proposed as a way of summarizing traffic information. Very few research works have addressed intrusion detection in flows from a visualizations perspective. In order to bridge this gap, the present paper proposes the application of a novel projection method (Beta Hebbian Learning) under this framework. With the aim to validate this method, 8 traffic segments, containing many flows, have been analysed by means of this projection method. The promising results obtained for these segments, extracted from the University of Twente dataset, validate the proposed application.</dc:description>
<dc:format>application/pdf</dc:format>
<dc:identifier>http://hdl.handle.net/10259/6635</dc:identifier>
<dc:language>eng</dc:language>
<dc:publisher>Oxford University Press</dc:publisher>
<dc:title>Advanced Visualization of Intrusions in Flows by Means of Beta-Hebbian Learning</dc:title>
<dc:type>info:eu-repo/semantics/article</dc:type>
<edm:type>TEXT</edm:type>
</edm:ProvidedCHO>
<ore:Aggregation rdf:about="http://hdl.handle.net/10259/6635#aggregation">
<edm:aggregatedCHO rdf:resource="http://hdl.handle.net/10259/6635"/>
<edm:dataProvider>RIUBU. Repositorio Institucional de la Universidad de Burgos</edm:dataProvider>
<edm:isShownAt rdf:resource="http://hdl.handle.net/10259/6635"/>
<edm:isShownBy rdf:resource="https://riubu.ubu.es/bitstream/10259/6635/5/Quintian-LjIGPL_2022.pdf"/>
<edm:object rdf:resource="https://riubu.ubu.es/bitstream/10259/6635/4/Quintian-ljIGPL_2022.pdf.jpg"/>
<edm:provider>Hispana</edm:provider>
<edm:rights rdf:resource="http://creativecommons.org/licenses/by/4.0/"/>
</ore:Aggregation>
<edm:WebResource rdf:about="https://riubu.ubu.es/bitstream/10259/6635/5/Quintian-LjIGPL_2022.pdf">
<edm:rights rdf:resource="http://creativecommons.org/licenses/by/4.0/"/>
</edm:WebResource>
</rdf:RDF></metadata></record></GetRecord></OAI-PMH>