Menü Überspringen
Kontakt
Presse
Deutsch
English
Not track
Datenverarbeitung
Suche
Anmelden
DIPF aktuell
Forschung
Infrastrukturen
Institut
Zurück
Kontakt
Presse
Deutsch
English
Not track
Datenverarbeitung
Suche
Startseite
>
Forschung
>
Publikationen
>
Publikationendatenbank
Ergebnis der Suche in der DIPF Publikationendatenbank
Ihre Abfrage:
(Schlagwörter: "Informatik")
zur erweiterten Suche
Suchbegriff
Nur Open Access
Suchen
Markierungen aufheben
Alle Treffer markieren
Export
25
Inhalte gefunden
Alle Details anzeigen
Toward supervised anomaly detection
Görnitz, Nico; Kloft, Marius; Rieck, Konrad; Brefeld, Ulf
Zeitschriftenbeitrag
| In: Journal of Artificial Intelligence Research | 2013
33335 Endnote
Autor*innen:
Görnitz, Nico; Kloft, Marius; Rieck, Konrad; Brefeld, Ulf
Titel:
Toward supervised anomaly detection
In:
Journal of Artificial Intelligence Research, 46 (2013) , S. 235-262
DOI:
10.1613/jair.3623
URL:
https://doi.org/10.1613/jair.3623
Dokumenttyp:
3a. Beiträge in begutachteten Zeitschriften; Aufsatz (keine besondere Kategorie)
Sprache:
Englisch
Schlagwörter:
Computerunterstütztes Verfahren; Daten; Datenanalyse; Informatik
Abstract (english):
Anomaly detection is being regarded as an unsupervised learning task as anomalies stem from adversarial or unlikely events with unknown distributions. However, the predictive performance of purely unsupervised anomaly detection often fails to match the required detection rates in many tasks and there exists a need for labeled data to guide the model generation. Our first contribution shows that classical semi-supervised approaches, originating from a supervised classifier, are inappropriate and hardly detect new and unknown anomalies. We argue that semi-supervised anomaly detection needs to ground on the unsupervised learning paradigm and devise a novel algorithm that meets this requirement. Although being intrinsically non-convex, we further show that the optimization problem has a convex equivalent under relatively mild assumptions. Additionally, we propose an active learning strategy to automatically filter candidates for labeling. In an empirical study on network intrusion detection data, we observe that the proposed learning methodology requires much less labeled data than the state-of-the-art, while achieving higher detection accuracies.
DIPF-Abteilung:
Informationszentrum Bildung
Finding similar movements in positional data streams
Haase, Jens; Brefeld, Ulf
Sammelbandbeitrag
| Aus: ECML/PKDD (Hrsg.): Proceedings of the ECML/PKDD Workshop on Machine Learning and Data Mining for Sports Analytics (ECML/PKDD 2013) | Prag: European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases | 2013
34024 Endnote
Autor*innen:
Haase, Jens; Brefeld, Ulf
Titel:
Finding similar movements in positional data streams
Aus:
ECML/PKDD (Hrsg.): Proceedings of the ECML/PKDD Workshop on Machine Learning and Data Mining for Sports Analytics (ECML/PKDD 2013), Prag: European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2013 , S. 1-9
URL:
http://www.kma.informatik.tu-darmstadt.de/fileadmin/user_upload/Group_KMA/kma_publications/paper_01.pdf
Dokumenttyp:
4. Beiträge in Sammelwerken; Tagungsband/Konferenzbeitrag/Proceedings
Sprache:
Englisch
Schlagwörter:
Algorithmus; Computerspiel; Computerunterstütztes Verfahren; Daten; Datenanalyse; Evaluation; Informatik
Abstract:
In this paper, we study the problem of efficiently finding similar movements in positional data streams, given a query trajectory. Our approach is based on a translation-, rotation-, and scale-invariant representation of movements. Near- neighbours given a query trajectory are then efficiently computed using dynamic time warping and locality sensitive hashing. Empirically, we show the efficiency and accuracy of our approach on positional data streams recorded from a real soccer game.
DIPF-Abteilung:
Informationszentrum Bildung
Learning shortest paths for word graphs
Tzouridis, Emmanouil; Brefeld, Ulf
Sammelbandbeitrag
| Aus: Atzmueller, Martin ; Scholz, Christoph (Hrsg.): The Fourth International Workshop on Mining Ubiquitous and Social Environments: MUSE' 13. September 23, 2013 (ECML/PKDD 2013) | Prag: European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases | 2013
34023 Endnote
Autor*innen:
Tzouridis, Emmanouil; Brefeld, Ulf
Titel:
Learning shortest paths for word graphs
Aus:
Atzmueller, Martin ; Scholz, Christoph (Hrsg.): The Fourth International Workshop on Mining Ubiquitous and Social Environments: MUSE' 13. September 23, 2013 (ECML/PKDD 2013), Prag: European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2013 , S. 45-57
URL:
http://www.kde.cs.uni-kassel.de/ws/muse2013/proceedings.pdf
Dokumenttyp:
4. Beiträge in Sammelwerken; Tagungsband/Konferenzbeitrag/Proceedings
Sprache:
Englisch
Schlagwörter:
Algorithmus; Grafische Darstellung; Informatik; Lernen; Satz; Struktur; Wort
Abstract:
The vast amount of information on the Web drives the need for aggregation and summarisation techniques. We study event extrac- tion as a text summarisation task using redundant sentences which is also known as sentence compression. Given a set of sentences describing the same event, we aim at generating a summarisation that is (i) a single sentence, (ii) simply structured and easily understandable, and (iii) minimal in terms of the number of words/tokens. Existing approaches for sentence compression are often based on finding the shortest path in word graphs that is spanned by related input sentences. These approaches, however, deploy manually crafted heuristics for edge weights and lack theoretical justification. In this paper, we cast sentence compression as a structured prediction problem. Edges of the compression graph are represented by features drawn from adjacent nodes so that corresponding weights are learned by a generalised linear model. Decoding is performed in polynomial time by a generalised shortest path algorithm using loss augmented inference. We report on preliminary results on artificial and real world data.
DIPF-Abteilung:
Informationszentrum Bildung
Learning shortest paths in word graphs
Tzouridis, Emmanouil; Brefeld, Ulf
Sammelbandbeitrag
| Aus: Henrich, Andreas ; Sperker, Hans-Christian (Hrsg.): LWA 2013: Lernen, Wissen & Adaptivität. Workshop Proceedings, Bamberg, 7.-9. Oktober 2013 | Bamberg: KDML | 2013
34026 Endnote
Autor*innen:
Tzouridis, Emmanouil; Brefeld, Ulf
Titel:
Learning shortest paths in word graphs
Aus:
Henrich, Andreas ; Sperker, Hans-Christian (Hrsg.): LWA 2013: Lernen, Wissen & Adaptivität. Workshop Proceedings, Bamberg, 7.-9. Oktober 2013, Bamberg: KDML, 2013 , S. 113-116
URL:
http://www.minf.uni-bamberg.de/lwa2013/proceedings/proceedings_lwa1013.pdf
Dokumenttyp:
4. Beiträge in Sammelwerken; Tagungsband/Konferenzbeitrag/Proceedings
Sprache:
Englisch
Schlagwörter:
Algorithmus; Grafische Darstellung; Informatik; Lernen; Mapping; Satz; Struktur; Wort
Abstract:
In this paper we briefly sketch our work on text summarisation using compression graphs. The task is described as follows: Given a set of related sentences describing the same event, we aim at generating a single sentence that is simply structured, easily understandable, and minimal in terms of the number of words/tokens. Traditionally, sentence compression deals with finding the shortest path in word graphs in an unsupervised setting. The major drawback of this approach is the use of manually crafted heuristics for edge weights. By contrast, we cast sentence compression as a structured prediction problem. Edges of the compression graph are represented by features drawn from adjacent nodes so that corresponding weights are learned by a generalised linear model. Decoding is performed in polynomial time by a generalised shortest path algorithm using loss augmented inference. We report on preliminary results on artificial and real world data.
DIPF-Abteilung:
Informationszentrum Bildung
Automata and Petri Net models for visualizing and analyzing complex questionnaires. A case study
Rölke, Heiko
Sammelbandbeitrag
| Aus: Duvigneau, Michael; Moldt, Daniel (Hrsg.): Proceedings of the International Workshop on Petri Nets and Software Engineering PNSE'10 ; [in Braga, Portugal on June 22, 2010] | Hamburg: Univ. | 2010
30059 Endnote
Autor*innen:
Rölke, Heiko
Titel:
Automata and Petri Net models for visualizing and analyzing complex questionnaires. A case study
Aus:
Duvigneau, Michael; Moldt, Daniel (Hrsg.): Proceedings of the International Workshop on Petri Nets and Software Engineering PNSE'10 ; [in Braga, Portugal on June 22, 2010], Hamburg: Univ., 2010 , S. 111-124
URN:
urn:nbn:de:gbv:18-228-7-1488
URL:
http://epub.sub.uni-hamburg.de/informatik/volltexte/2010/148/
Dokumenttyp:
4. Beiträge in Sammelwerken; Tagungsband/Konferenzbeitrag/Proceedings
Sprache:
Englisch
Schlagwörter:
Computerprogramm; Datenanalyse; Informatik; Informationsverarbeitung; Internet; Modellierung; Netzarchitektur; Software; Tagungsbericht
Abstract:
Fragebögen in komplexe Studien können beachtliche Größen annehmen. Mehrere Hundert Fragen sind nicht unüblich. Zusätzlich werden Bedingungen eingesetzt um zwischen unterschiedlichen Abläufen für unterschiedliche Befragte zu unterscheiden. Dies führt zur Frage, wie Gültigkeit und andere wichtige Eigenschaften sichergestellt werden können. Wir untersuchen diese Fragestellung an einem Fall mit sogar noch größeren Herausforderungen: Ein wichtiger Teil der OECD-Studie "PIAAC" (Programme for the International Assessment of Adult Competencies) ist ein Hintergrundfragebogen mit mehr als 400 Fragen. Dieser Fragebogen muss von allen teilnehmenden Ländern angepasst werden. Trotzdem muss die Integrität des Gesamtsystems gewährleistet werden.(DIPF/Orig.)
Abstract (english):
Questionnaires for complex studies can grow to considerablesizes. Several hundred questions are not uncommon. In addition, routings are used to distinguish between question paths for differentrespondents. This leads to the question of how to ensure validity andother important properties. We examine this question for a case with even more demanding sideconditions: An important part of the OECD study "PIAAC" (Programme forthe International Assessment of Adult Competencies) is a background questionnaire (BQ) containing more than 400 questions. This BQ has tobe adapted by all participating countries. Nevertheless, integrity ofthe overall system has to be ensured.(DIPF/Orig.)
DIPF-Abteilung:
Informationszentrum Bildung
Girls' Day - Zukunft für Mädchen
Hirschmann, Doris
Verschiedenartige Dokumente
| 2010
30007 Endnote
Autor*innen:
Hirschmann, Doris
Titel:
Girls' Day - Zukunft für Mädchen
Erscheinungsvermerk:
Frankfurt am Main: Deutsches Institut für Internationale Pädagogische Forschung, 2010
URL:
http://www.bildungsserver.de/zeigen.html?seite=4173
Dokumenttyp:
5. Arbeits- und Diskussionspapiere; Dokumentarischer Beitrag
Sprache:
Deutsch
Schlagwörter:
Beratung; Berufsorientierung; Informatik; Internet; Mädchen; Naturwissenschaft; Netzwerk; Projekt; Quellensammlung; Studienwahl; Technik
Abstract:
Seit 2001 findet jedes Jahr am 4. Donnerstag im April der Girls` Day statt. Der bundesweite Girls`Day - Mädchen-Zukunftstag ermöglicht Schülerinnen ab der Klasse 5 Einblicke in Technik, IT, Naturwissenschaften und Handwerk. Girls` Day-Teilnehmerinnen bewerten das Image technisch-naturwissenschaftlicher Berufe zunehmend positiv. Sie sehen diese Berufe heute häufiger als abwechslungsreich an als noch vor fünf Jahren, das bestätigt eine Langzeitstudie zum Aktionstag. Seit Einführung des Girls' Day entwickeln sich die Zahlen der Ausbildungs- und Studienanfängerinnen in technischen Bereichen positiv.Über diese Seite sind die aktuellen Informationen für eine Beteiligung erreichbar. (DIPF/ Orig.)
DIPF-Abteilung:
Informationszentrum Bildung
Modeling with net references and synchronous channels
Rölke, Heiko
Sammelbandbeitrag
| Aus: Moldt, Daniel (Hrsg.): International Workshop on Petri Nets and Software Engineering: PNSE'2009 June 22-23, 2009, a satellite event of Petri Nets' 2009, 30th International Conference on Application and Theory of Petri Nets and O ther Models of Concurrency, June 22-26, 2009 Paris, France | Paris: Université Paris | 2009
7982 Endnote
Autor*innen:
Rölke, Heiko
Titel:
Modeling with net references and synchronous channels
Aus:
Moldt, Daniel (Hrsg.): International Workshop on Petri Nets and Software Engineering: PNSE'2009 June 22-23, 2009, a satellite event of Petri Nets' 2009, 30th International Conference on Application and Theory of Petri Nets and O ther Models of Concurrency, June 22-26, 2009 Paris, France, Paris: Université Paris, 2009 , S. 157-172
URL:
http://www.informatik.uni-hamburg.de/TGI/events/pnse09/PNSE-09-official-proceedings.pdf
Dokumenttyp:
4. Beiträge in Sammelwerken; Tagungsband/Konferenzbeitrag/Proceedings
Sprache:
Englisch
Schlagwörter:
Petri-Netz; Modellierung; Informatik; Netzarchitektur; Kongress
Abstract (english):
Nets-within-nets offer some modeling possibilitieswhich are not available ( or only to a limited extent) in classicalPetri nets formalisms like P/T nets or colored Petri nets. This holdsespecially true in the formalism of reference nets. The extendedmodeling possibilities arise from the newly come concepts, e.g. netinstances generated at run-time and synchronization betweentransitions. This paper focuses on practical aspects of the newmodeling possibilities - rather than theoretical backgrounds - anddemonstrates them in practical examples. As a modeling languagereference nets are used. This is the onlynets-within- nets formalism implemented up to now and with Renew a powerful simulation tool-set is available. The examples presented throughout the paper can serve as anintroduction to advanced modeling using reference nets. (Autor)
DIPF-Abteilung:
Informationszentrum Bildung
Petri Nets and distributed systems. PNDS'08, Proceedings of the International Workshop, part of the […]
Sidorova, Natalia; Moldt, Daniel; Rölke, Heiko (Hrsg.)
Sammelband
| Xi'an: Univ. | 2008
7985 Endnote
Herausgeber*innen:
Sidorova, Natalia; Moldt, Daniel; Rölke, Heiko
Titel:
Petri Nets and distributed systems. PNDS'08, Proceedings of the International Workshop, part of the International Conference on Application and Theory of Petri Nets and other Models of Concurrency
Erscheinungsvermerk:
Xi'an: Univ., 2008
Dokumenttyp:
2. Herausgeberschaft; Sammelband (keine besondere Kategorie)
Sprache:
Englisch
Schlagwörter:
Petri-Netz; Modellierung; Softwareentwicklung; Netzarchitektur; Informatik; Datenanalyse; Informationsverarbeitung
Abstract (english):
This booklet contains the proceedings of the International Workshop on Petri Nets andDistributed Systems (PNDS'08) in Xi'an, China, June 23-24, 2008. It is a satellite event ofPetri Nets 2008, the 29th International Conference on Application and Theory of Petri Netsand Other Models of Concurrency. PNDS'08 is organized by institutes from Eindhoven University of Technology, TheNetherlands, the University of Hamburg, Germany, and the German Institute for InternationalEducational Research, Frankfurt, Germany. More information about the workshop can be found at http://www.informatik.uni- hamburg.de/TGI/events/pnds08/. For the successful realization of complex systems of interacting and reactive software andhardware components the use of a precise language at different stages of the developmentprocess is of crucial importance. Petri nets are becoming increasingly popular in this area, asthey provide a uniform language that supports the tasks of modelling, validation andverification. Their popularity is due to the fact that fundamental aspects of causality,concurrency and choice are captured by Petri nets in a natural and mathematically precise waywithout compromising readability.The use of Petri nets (P/T-nets, colored Petri nets and extensions) related to all aspects ofdistributed systems, covering modelling, validation, and verification, are presented as well astheir application and tools supporting the disciplines mentioned above.The intention of this workshop is to bring together research and application to have a livelymutual exchange of ideas, view points, knowledge, and experience. (Autor)
DIPF-Abteilung:
Informationszentrum Bildung
Petri net controlled finite automata
Farwer, Berndt; Jantzen, Matthias; Kudlek, Manfred; Rölke, Heiko; Zetsche, Georg
Zeitschriftenbeitrag
| In: Fundamenta Informaticae | 2008
7984 Endnote
Autor*innen:
Farwer, Berndt; Jantzen, Matthias; Kudlek, Manfred; Rölke, Heiko; Zetsche, Georg
Titel:
Petri net controlled finite automata
In:
Fundamenta Informaticae, 85 (2008) , S. 111-121
Dokumenttyp:
3a. Beiträge in begutachteten Zeitschriften; Aufsatz (keine besondere Kategorie)
Sprache:
Englisch
Schlagwörter:
Petri-Netz; Modellierung; Sprache; Netzarchitektur; Informatik
Abstract (english):
We present a generalization of finite automata using Petri nets as control, called Concurrent Finite Automata for short. Several modes of acceptance, defined by final markings of the Petri net, are introduced, and their equivalence is shown. The class of languages obtained by l-free concurrent finite automata contains both the class of regular sets and the class of Petri net languages defined by final marking, and is contained in the class of context-sensitive languages. (Autor)
DIPF-Abteilung:
Informationszentrum Bildung
A monitoring toolset for PAOSE
Cabac, Lawrence; Dörges, Till; Rölke, Heiko
Sammelbandbeitrag
| Aus: Hee, Kees Max van; Rüdiger, Valk (Hrsg.): Applications and theory of Petri nets: 29th International Conference, PETRI NETS 2008, Xi'an, China, June 23-27, 2008, proceedings | Berlin: Spinger | 2008
7983 Endnote
Autor*innen:
Cabac, Lawrence; Dörges, Till; Rölke, Heiko
Titel:
A monitoring toolset for PAOSE
Aus:
Hee, Kees Max van; Rüdiger, Valk (Hrsg.): Applications and theory of Petri nets: 29th International Conference, PETRI NETS 2008, Xi'an, China, June 23-27, 2008, proceedings, Berlin: Spinger, 2008 (Lecture notes in computer science, 5062), S. 399-408
DOI:
10.1007/978-3-540-68746-7_26
URL:
http://dx.doi.org/10.1007/978-3-540-68746-7_26
Dokumenttyp:
4. Beiträge in Sammelwerken; Tagungsband/Konferenzbeitrag/Proceedings
Sprache:
Englisch
Schlagwörter:
Petri-Netz; Softwareentwicklung; Computerprogramm; Netzarchitektur; Modell; Modellierung; Datenverarbeitung; Datenanalyse; Informatik; Informationswissenschaft
Abstract (english):
Paose (Petri net-based Agent-Oriented Software Engineering) combines the paradigm of AOSE (Agent-Oriented Software Engineering), with the expressive power of Petri nets - reference netsto be more precise. While AOSE is a powerful approach when itcomes to designing and developing distributed (agent) applications, itdoes not address the problems specific to debugging, monitoring, andtesting of these applications, i.e. no global state of the system and verydynamic operating conditions. To tackle these problems, two tools havebeen developed in the context of Paose, which are presented in thiswork.Firstly, this paper will give a short overview over the interrelated set oftools, which exists already and supports Petri net- based AOSE. The toolsare centered around the Petri net-based multi- agent system developmentand runtime environment Renew/Mulan/Capa. Secondly, Mulan-Viewer and Mulan-Sniffer will be presented in moredetail - two tools to address the issues encountered during debugging, monitoring, and testing agent applications. Both tools are first class members of the aforementioned family. The first tool, Mulan-Viewer, deals with the introspection of agents and agent behaviors, while it alsooffers rudimentary features for controlling the agent-system. The Mulan-Sniffer as the second tool places emphasis on tracing, visualizing, and analyzing communication between all parts of the multi-agent applicationand offers interfaces for more advanced methods of analysis, such as process mining. Both Mulan-Viewer and Mulan-Sniffer are realizedas Renew plugins that can also be extended by other plugins. (Autor)
DIPF-Abteilung:
Informationszentrum Bildung
Markierungen aufheben
Alle Treffer markieren
Export
<
1
2
(aktuell)
3
>
Alle anzeigen
(25)