Umeå University's logo

umu.sePublications
Change search
Refine search result
1 - 19 of 19
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1.
    Aler Tubella, Andrea
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Coelho Mollo, Dimitri
    Umeå University, Faculty of Arts, Department of historical, philosophical and religious studies.
    Dahlgren, Adam
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Devinney, Hannah
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Dignum, Virginia
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Ericson, Petter
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Jonsson, Anna
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Kampik, Timotheus
    Umeå University, Faculty of Science and Technology, Department of Computing Science. SAP Signavio, Germany.
    Lenaerts, Tom
    Université Libre de Bruxelles, Belgium; University of California, Berkeley, USA.
    Mendez, Julian Alfredo
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Nieves, Juan Carlos
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    ACROCPoLis: a descriptive framework for making sense of fairness2023In: FAccT '23: Proceedings of the 2023 ACM conference on fairness, accountability, and transparency, ACM Digital Library, 2023, p. 1014-1025Conference paper (Refereed)
    Abstract [en]

    Fairness is central to the ethical and responsible development and use of AI systems, with a large number of frameworks and formal notions of algorithmic fairness being available. However, many of the fairness solutions proposed revolve around technical considerations and not the needs of and consequences for the most impacted communities. We therefore want to take the focus away from definitions and allow for the inclusion of societal and relational aspects to represent how the effects of AI systems impact and are experienced by individuals and social groups. In this paper, we do this by means of proposing the ACROCPoLis framework to represent allocation processes with a modeling emphasis on fairness aspects. The framework provides a shared vocabulary in which the factors relevant to fairness assessments for different situations and procedures are made explicit, as well as their interrelationships. This enables us to compare analogous situations, to highlight the differences in dissimilar situations, and to capture differing interpretations of the same situation by different stakeholders.

    Download full text (pdf)
    fulltext
  • 2.
    Björklund, Henrik
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Berglund, Martin
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Petter, Ericson
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Uniform vs. Nonuniform Membership for Mildly Context-Sensitive Languages: A Brief Survey2016In: Algorithms, E-ISSN 1999-4893, Vol. 9, no 2, article id 32Article in journal (Refereed)
    Abstract [en]

    Parsing for mildly context-sensitive language formalisms is an important area within natural language processing. While the complexity of the parsing problem for some such formalisms is known to be polynomial, this is not the case for all of them. This article presents a series of results regarding the complexity of parsing for linear context-free rewriting systems and deterministic tree-walking transducers. We discuss the difference between uniform and nonuniform complexity measures and how parameterized complexity theory can be used to investigate how different aspects of the formalisms influence how hard the parsing problem is. The main results we survey are all hardness results and indicate that parsing is hard even for relatively small values of parameters such as rank and fan-out in a rewriting system.

    Download full text (pdf)
    fulltext
  • 3.
    Björklund, Henrik
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Björklund, Johanna
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Ericson, Petter
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Minimisation and Characterisation of Order-Preserving DAG Grammars2018Report (Other academic)
    Abstract [en]

    Order-preserving DAG grammars (OPDGs) is a formalism for processing semantic infor- mation in natural languages [5, 4]. OPDGs are sufficiently expressive to model abstract meaning representations, a graph-based form of semantic representation in which nodes en- code objects and edges relations. At the same time, they allow for efficient parsing in the uniform setting, where both the grammar and subject graph are taken as part of the input.

    In this article, we introduce an initial algebra semantic for OPDGs, which allows us to view them as regular tree grammars. This makes it possible to transfer a number of results from that domain to OPDGs, both in the unweighted and the weighted case. In particular, we show that deterministic OPDGs can be minimised efficiently, and that they are learnable in the so-called MAT setting. To conclude, we show that the languages generated by OPDGs are MSO-definable.

    Download full text (pdf)
    fulltext
  • 4.
    Björklund, Henrik
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Björklund, Johanna
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Ericson, Petter
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    On the Regularity and Learnability of Ordered DAG Languages2017In: Implementation and Application of Automata: 22nd International Conference, CIAA 2017, Marne-la-Vallée, France, June 27-30, 2017, Proceedings / [ed] Arnaud Carayol and Cyril Nicaud, Cham, 2017, p. 27-39Conference paper (Refereed)
    Abstract [en]

    Order-Preserving DAG Grammars (OPDGs) is a subclass of Hyper-Edge Replacement Grammars that can be parsed in polynomial time. Their associated class of languages is known as Ordered DAG Lan- guages, and the graphs they generate are characterised by being acyclic, rooted, and having a natural order on their nodes. OPDGs are useful in natural-language processing to model abstract meaning representa- tions. We state and prove a Myhill-Nerode theorem for ordered DAG languages, and translate it into a MAT-learning algorithm for the same class. The algorithm infers a minimal OPDG G for the target language in time polynomial in G and the samples provided by the MAT oracle. 

  • 5.
    Björklund, Henrik
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Björklund, Johanna
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Ericson, Petter
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Tree-based generation of restricted graph languages2023In: International Journal of Foundations of Computer Science, ISSN 0129-0541Article in journal (Refereed)
    Abstract [en]

    Order-preserving DAG grammars (OPDGs) is a formalism for representing languages of structurally restricted graphs. As demonstrated in [17], they are sufficiently expressive to model abstract meaning representations in natural language processing, a graph-based form of semantic representation in which nodes encode objects and edges relations. At the same time, they can be parsed in O (n2 + nm) , where m and n are the sizes of the grammar and the input graph, respectively. In this work, we provide an initial algebra semantic for OPDGs, which allows us to view them as regular tree grammars under an equivalence theory. This makes it possible to transfer results from the field of formal tree languages to the domain of OPDGs, both in the unweighted and the weighted case. In particular, we show that deterministic OPDGs can be minimised efficiently, and that they are learnable under the \minimal adequeate teacher" paradigm, that is, by querying an oracle for equivalence between languages, and membership of individual graphs. To conclude, we demonstrate that the languages generated by OPDGs are definable in monadic second-order logic.

  • 6.
    Björklund, Henrik
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Drewes, Frank
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Ericson, Petter
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Between a Rock and a Hard Place: Parsing for Hyperege Replacement DAG Grammars2016In: Proc. 10th International Conference on Language and Automata Theory and Applications (LATA 2016) / [ed] A.H. Dediu, J. Janoušek, C. Martín-Vide, and B. Truthe, Springer Publishing Company, 2016, Vol. 9618, p. 521-532Conference paper (Refereed)
    Abstract [en]

    Motivated by applications in natural language processing, we study the uniform membership problem for hyperedge-replacement grammars that generate directed acyclic graphs. Our major result is a low-degree polynomial-time algorithm that solves the uniform membership problem for a restricted type of such grammars. We motivate the necessity of the restrictions by two different NP-completeness results.

  • 7.
    Björklund, Henrik
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Drewes, Frank
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Ericson, Petter
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Parsing Weighted Order-Preserving Hyperedge Replacement Grammars2019In: Proceedings of the 16th Meeting on the Mathematics of Language / [ed] F. Drewes, P. de Groote, G. Penn, Association for Computational Linguistics, 2019, p. 1-11Conference paper (Refereed)
    Abstract [en]

    We introduce a weighted extension of the recently proposed notion oforder-preserving hyperedge-replacement grammars and prove that the weightof a graph according to such a weighted graph grammar can be computeduniformly in quadratic time (under assumptions made precise in the paper).

    Download full text (pdf)
    fulltext
  • 8.
    Björklund, Henrik
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Drewes, Frank
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Ericson, Petter
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Parsing Weighted Order-Preserving Hyperedge Replacement Grammars2018Report (Other academic)
    Abstract [en]

    We introduce a weighted extension of the recently proposed notion of order-preserving hyperedge-replacement grammars and prove that the weight of a graph according to such a weighted graph grammar can be computed uniformly in quadratic time (under assumptions made precise in the paper).

    Download full text (pdf)
    fulltext
  • 9.
    Björklund, Henrik
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Drewes, Frank
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Ericson, Petter
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Starke, Florian
    Faculty of Computer Science, TU Dresden.
    Uniform Parsing for Hyperedge Replacement Grammars2018Report (Other academic)
    Abstract [en]

    It is well known that hyperedge-replacement grammars can generate NP-complete graph languages even under seemingly harsh restrictions. This means that the parsing problem is difficult even in the non-uniform setting, in which the grammar is considered to be fixed rather than being part of the input. Little is known about restrictions under which truly uniform polynomial parsing is possible. In this paper we propose a low-degree polynomial-time algorithm that solves the uniform parsing problem for a restricted type of hyperedge-replacement grammars which we expect to be of interest for practical applications.

    Download full text (pdf)
    fulltext
  • 10.
    Björklund, Henrik
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Drewes, Frank
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Ericson, Petter
    Umeå University, Faculty of Science and Technology, Department of Computing Science. Digital and Cognitive Musicology Lab, Ecole Polytechnique F´ed´erale de Lausanne, Switzerland.
    Starke, Florian
    Faculty of Computer Science, TU Dresden, Germany.
    Uniform Parsing for Hyperedge Replacement Grammars2021In: Journal of computer and system sciences (Print), ISSN 0022-0000, E-ISSN 1090-2724, Vol. 118, p. 1-27Article in journal (Refereed)
    Abstract [en]

    It is well known that hyperedge-replacement grammars can generate NP-complete graph languages even under seemingly harsh restrictions. This means that the parsing problem is difficult even in the non-uniform setting, in which the grammar is considered to be fixed rather than being part of the input. Little is known about restrictions under which truly uniform polynomial parsing is possible. In this paper we propose a low-degree polynomial-time algorithm that solves the uniform parsing problem for a restricted type of hyperedge-replacement grammars which we expect to be of interest for practical applications.

    Download full text (pdf)
    fulltext
  • 11.
    Björklund, Henrik
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Ericson, Petter
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    A note on the complexity of deterministic tree-walking transducers2013In: Non-Classical Models of Automata and Applications (NCMA 2013), Österreichische Computer Gesellschaft , 2013Conference paper (Refereed)
  • 12.
    Ericson, Petter
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    A bottom-up automaton for tree adjoining languages2015Report (Other academic)
    Abstract [en]

    Current tree parsing algorithms for nonregular tree languages all have superlinear running times, possibly limiting their practical applicability. We present a bottom-up tree automaton that captures exactly the tree-adjoining languages in the non-deterministic case. The determinstic case captures a strict superset of the regular tree languages, while preserving running times linear in the size of the tree.

    Download full text (pdf)
    fulltext
  • 13.
    Ericson, Petter
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Complexity and expressiveness for formal structures in Natural Language Processing2017Licentiate thesis, comprehensive summary (Other academic)
    Abstract [en]

    The formalized and algorithmic study of human language within the field of Natural Language Processing (NLP) has motivated much theoretical work in the related field of formal languages, in particular the subfields of grammar and automata theory. Motivated and informed by NLP, the papers in this thesis explore the connections between expressibility – that is, the ability for a formal system to define complex sets of objects – and algorithmic complexity – that is, the varying amount of effort required to analyse and utilise such systems. Our research studies formal systems working not just on strings, but on more complex structures such as trees and graphs, in particular syntax trees and semantic graphs. The field of mildly context-sensitive languages concerns attempts to find a useful class of formal languages between the context-free and context-sensitive. We study formalisms defining two candidates for this class; tree-adjoining languages and the languages defined by linear context-free rewriting systems. For the former, we specifically investigate the tree languages, and define a subclass and tree automaton with linear parsing complexity. For the latter, we use the framework of parameterized complexity theory to investigate more deeply the related parsing problems, as well as the connections between various formalisms defining the class. The field of semantic modelling aims towards formally and accurately modelling not only the syntax of natural language statements, but also the meaning. In particular, recent work in semantic graphs motivates our study of graph grammars and graph parsing. To the best of our knowledge, the formalism presented in Paper III of this thesis is the first graph grammar where the uniform parsing problem has polynomial parsing complexity, even for input graphs of unbounded node degree.

    Download full text (pdf)
    fulltext
  • 14.
    Ericson, Petter
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Investigating different graph representations of semantics2016Conference paper (Refereed)
    Abstract [en]

    Combinatory Categorial Grammar is a generic approach to the mechanical understanding of language, where movement is minimised in favour of using combinators such as B (composition) and T (type lifting) to clearly define in which ways various constituents can refer to each other. Taking the tree languages induced by the syntactic derivations and connecting the various leaves linked through the semantics, one ends up with a class of graph languages. The present work aims to point out promising avenues of research in order to investigate this class, specifically in terms of similarities with other graph-based semantic representations, such as Abstract Meaning Representations (AMR), and furthermore what graph generating or recognising formalism would be most suitable to define the class characteristics.

    Download full text (pdf)
    fulltext
  • 15.
    Ericson, Petter
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Order-preserving graph grammars2019Doctoral thesis, comprehensive summary (Other academic)
    Abstract [en]

    The field of semantic modelling concerns formal models for semantics, that is, formal structures for the computational and algorithmic processing of meaning. This thesis concerns formal graph languages motivated by this field. In particular, we investigate two formalisms: Order-Preserving DAG Grammars (OPDG) and Order-Preserving Hyperedge Replacement Grammars (OPHG), where OPHG generalise OPDG.

    Graph parsing is the practise of, given a graph grammar and a graph, to determine if, and in which way, the grammar could have generated the graph. If the grammar is considered fixed, it is the non-uniform graph parsing problem, while if the grammars is considered part of the input, it is named the uniform graph parsing problem. Most graph grammars have parsing problems known to be NP-complete, or even exponential, even in the non-uniform case. We show both OPDG and OPHG to have polynomial uniform parsing problems, under certain assumptions.

    We also show these parsing algorithms to be suitable, not just for determining membership in graph languages, but for computing weights of graphs in graph series.

    Additionally, OPDG is shown to have several properties common to regular languages, such as MSO definability and MAT learnability. We moreover show a direct corresponcence between OPDG and the regular tree grammars.

    Finally, we present some limited practical experiments showing that real-world semantic graphs appear to mostly conform to the requirements set by OPDG, after minimal, reversible processing.

    Download full text (pdf)
    kappa
    Download (pdf)
    spikblad
    Download (png)
    framsida
  • 16.
    Ericson, Petter
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Rammos, Yannis
    École Polytechnique, Fédérale de Lausanne, Switzerland.
    Rohrmeier, Martin
    École Polytechnique, Fédérale de Lausanne, Switzerland.
    Musereduce: a generic framework for hierarchical music analysis2023In: Music Encoding Conference 2022 Proceedings / [ed] Ailynn Ang; Jennifer Bain; David M. Weigl, Music Encoding Initiative , 2023, p. 40-51Conference paper (Refereed)
    Abstract [en]

    In comparison to computational linguistics, with its abundance of natural-language datasets, corpora of music analyses are rather fewer and generally smaller. This is partly due to difficulties inherent to the encoding of music analyses, whose multimodal representations—typically a combination of music notation, graphic notation, and natural language—are designed for communication between human musician-analysts, not for automated large-scale data analysis. Analyses based on hierarchical models of tonal structure, such as Heinrich Schenker’s, present additional notational and encoding challenges, since they establish relations between non- adjacent tones, and typically interpret successions of tones as expressions of abstract chordal sonorities, which may not be literally present in the music score. Building on a published XML format by Rizo and Marsden (2019), which stores analyses alongside symbolically encoded scores, this paper presents a generic graph model for reasoning about music analyses, as well as a graphical web application for creating and encoding music analyses in the aforementioned XML format. Several examples are given showing how various techniques of music analysis, primarily but not necessarily hierarchical, might be unambiguously represented through this model.

    Download full text (pdf)
    fulltext
  • 17.
    Harasim, Daniel
    et al.
    Digital and Cognitive Musicology Lab, École Polytechnique Fédérale de Lausanne, Switzerland.
    Finkensiep, Christoph
    Digital and Cognitive Musicology Lab, École Polytechnique Fédérale de Lausanne, Switzerland.
    Ericson, Petter
    Digital and Cognitive Musicology Lab, École Polytechnique Fédérale de Lausanne, Switzerland.
    O’Donnell, Timothy J.
    Department of Linguistics, McGill University, Canada.
    Rohrmeier, Martin
    Digital and Cognitive Musicology Lab, École Polytechnique Fédérale de Lausanne, Switzerland.
    The jazz harmony treebank2020In: Proceedings of the 21st ISMIR Conference, 2020, p. 207-215Conference paper (Refereed)
    Abstract [en]

    Grammatical models which represent the hierarchical structure of chord sequences have proven very useful in recent analyses of Jazz harmony. A critical resource for building and evaluating such models is a ground-truth database of syntax trees that encode hierarchical analyses of chord sequences. In this paper, we introduce the Jazz Harmony Treebank (JHT), a dataset of hierarchical analyses of complete Jazz standards. The analyses were created and checked by experts, based on lead sheets from the open iRealPro collection. The JHT is publicly available in JavaScript Object Notation (JSON), a human-understandable and machine-readable format for structured data. We additionally discuss statistical properties of the corpus and present a simple open-source web application for the graphical creation and editing of trees which was developed during the creation of the dataset.

    Download full text (pdf)
    fulltext
  • 18. Snook, Kelly
    et al.
    Barri, Tarik
    Bolles, Monica
    Ericson, Petter
    Umeå University, Faculty of Science and Technology, Department of Computing Science. Digital and Cognitive Musicology Lab, École Polytechnique Fédérale de Lausanne, Lausanne, Switzerland.
    Fravel, Carl
    Gossmann, Joachim
    Green-Mateub, Susan E.
    Luck, Andrew
    Schedel, Margaret
    Thomas, Robert
    Concordia: A musical XR instrument for playing the solar system2020In: Journal of New Music Research, ISSN 0929-8215, E-ISSN 1744-5027, Vol. 49, no 1, p. 88-103Article in journal (Refereed)
    Abstract [en]

    Kepler Concordia, a new scientific and musical instrument enabling players to explore the solar system and other data within immersive extended-reality (XR) platforms, is being designed by a diverse team of musicians, artists, scientists and engineers using audio-first principles. The core instrument modules will be launched in 2019 for the 400th anniversary of Johannes Kepler's Harmonies of the World, in which he laid out a framework for the harmony of geometric form as well as the three laws of planetary motion. Kepler's own experimental process can be understood as audio-first because he employed his understanding of Western Classical music theory to investigate and discover the heliocentric, elliptical behaviour of planetary orbits. Indeed, principles of harmonic motion govern much of our physical world and show up at all scales in mathematics and physics. Few physical systems, however, offer such rich harmonic complexity and beauty as our own solar system. Concordia is a musical instrument that is modular, extensible and designed to allow players to generate and explore transparent sonifications of planetary movements rooted in the musical and mathematical concepts of Johannes Kepler as well as researchers who have extended Kepler's work, such as Hartmut Warm. Its primary function is to emphasise the auditory experience by encouraging musical explorations using sonification of geometric and relational information of scientifically accurate planetary ephemeris and astrodynamics. Concordia highlights harmonic relationships of the solar system through interactive sonic immersion. This article explains how we prioritise data sonification and then add visualisations and gamification to create a new type of experience and creative distributed-ledger powered ecosystem. Kepler Concordia facilitates the perception of music while presenting the celestial harmonies through multiple senses, with an emphasis on hearing, so that, as Kepler wrote, 'the mind can seize upon the patterns'.

  • 19.
    Tatar, Kivanç
    et al.
    Department of Computer Science and Engineering, Data Science and AI Division, Chalmers University of Technology, Gothenburg, Sweden.
    Ericson, Petter
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Cotton, Kelsey
    Department of Computer Science and Engineering, Data Science and AI Division, Chalmers University of Technology, Gothenburg, Sweden.
    Del Prado, Paola Torres Núñez
    Stockholm University of the Arts, Stockholm, Sweden.
    Batlle-Roca, Roser
    Universitat Pompeu Fabra, Tanger, Barcelona, Spain.
    Cabrero-Daniel, Beatriz
    Department of Computer Science and Engineering, University of Gothenburg.
    Ljungblad, Sara
    Department of Computer Science and Engineering, Interaktionsdesign, University of Gothenburg, Gothenburg, Sweden.
    Diapoulis, Georgios
    Department of Computer Science and Engineering, Interaktionsdesign, University of Gothenburg, Gothenburg, Sweden.
    Hussain, Jabbar
    Department of Applied IT, University of Gothenburg, Gothenburg, Sweden.
    A shift in artistic practices through artificial intelligence2024In: Leonardo: Journal of the International Society for the Arts, Sciences and Technology, ISSN 0024-094X, E-ISSN 1530-9282, p. 293-297Article in journal (Refereed)
    Abstract [en]

    The explosion of content generated by artificial intelligence (AI) models has initiated a cultural shift in arts, music, and media, whereby roles are changing, values are shifting, and conventions are challenged. The vast, readily available dataset of the Internet has created an environment for AI models to be trained on any content on the Web. With AI models shared openly and used by many globally, how does this new paradigm shift challenge the status quo in artistic practices? What kind of changes will AI technology bring to music, arts, and new media?

1 - 19 of 19
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf