2 datasets found
  1. f

    Data from: Computing Data-driven Multilinear Metro Maps

    • tandf.figshare.com
    xml
    Updated Sep 17, 2024
    Share
    FacebookFacebook
    TwitterTwitter
    Email
    Click to copy link
    Link copied
    Close
    Cite
    Martin Nöllenburg; Soeren Terziadis (2024). Computing Data-driven Multilinear Metro Maps [Dataset]. http://doi.org/10.6084/m9.figshare.26148687.v1
    Explore at:
    xmlAvailable download formats
    Dataset updated
    Sep 17, 2024
    Dataset provided by
    Taylor & Francis
    Authors
    Martin Nöllenburg; Soeren Terziadis
    License

    Attribution 4.0 (CC BY 4.0)https://creativecommons.org/licenses/by/4.0/
    License information was derived automatically

    Description

    Traditionally, most schematic metro maps in practice as well as metro map layout algorithms adhere to an octolinear layout style with all paths composed of horizontal, vertical, and 45∘-diagonal edges. Despite growing interest in more general multilinear metro maps, generic algorithms to draw metro maps based on a system of k≥2 not necessarily equidistant slopes have not been investigated thoroughly. In this paper, we present and implement an adaptation of the octolinear mixed-integer linear programming approach of Nöllenburg and Wolff (2011) that can draw metro maps schematized to any set C of arbitrary orientations. We further present a data-driven approach to determine a suitable set C by either detecting the best rotation of an equidistant orientation system or by clustering the input edge orientations using a k-medians algorithm. We demonstrate the new possibilities of our method using several real-world examples.

  2. f

    Metro Maps of Plant Disease Dynamics—Automated Mining of Differences Using...

    • plos.figshare.com
    zip
    Updated May 31, 2023
    Share
    FacebookFacebook
    TwitterTwitter
    Email
    Click to copy link
    Link copied
    Close
    Cite
    Mirwaes Wahabzada; Anne-Katrin Mahlein; Christian Bauckhage; Ulrike Steiner; Erich-Christian Oerke; Kristian Kersting (2023). Metro Maps of Plant Disease Dynamics—Automated Mining of Differences Using Hyperspectral Images [Dataset]. http://doi.org/10.1371/journal.pone.0116902
    Explore at:
    zipAvailable download formats
    Dataset updated
    May 31, 2023
    Dataset provided by
    PLOS ONE
    Authors
    Mirwaes Wahabzada; Anne-Katrin Mahlein; Christian Bauckhage; Ulrike Steiner; Erich-Christian Oerke; Kristian Kersting
    License

    Attribution 4.0 (CC BY 4.0)https://creativecommons.org/licenses/by/4.0/
    License information was derived automatically

    Description

    Understanding the response dynamics of plants to biotic stress is essential to improve management practices and breeding strategies of crops and thus to proceed towards a more sustainable agriculture in the coming decades. In this context, hyperspectral imaging offers a particularly promising approach since it provides non-destructive measurements of plants correlated with internal structure and biochemical compounds. In this paper, we present a cascade of data mining techniques for fast and reliable data-driven sketching of complex hyperspectral dynamics in plant science and plant phenotyping. To achieve this, we build on top of a recent linear time matrix factorization technique, called Simplex Volume Maximization, in order to automatically discover archetypal hyperspectral signatures that are characteristic for particular diseases. The methods were applied on a data set of barley leaves (Hordeum vulgare) diseased with foliar plant pathogens Pyrenophora teres, Puccinia hordei and Blumeria graminis hordei. Towards more intuitive visualizations of plant disease dynamics, we use the archetypal signatures to create structured summaries that are inspired by metro maps, i.e. schematic diagrams of public transport networks. Metro maps of plant disease dynamics produced on several real-world data sets conform to plant physiological knowledge and explicitly illustrate the interaction between diseases and plants. Most importantly, they provide an abstract and interpretable view on plant disease progression.

  3. Not seeing a result you expected?
    Learn how you can add new datasets to our index.

Share
FacebookFacebook
TwitterTwitter
Email
Click to copy link
Link copied
Close
Cite
Martin Nöllenburg; Soeren Terziadis (2024). Computing Data-driven Multilinear Metro Maps [Dataset]. http://doi.org/10.6084/m9.figshare.26148687.v1

Data from: Computing Data-driven Multilinear Metro Maps

Related Article
Explore at:
xmlAvailable download formats
Dataset updated
Sep 17, 2024
Dataset provided by
Taylor & Francis
Authors
Martin Nöllenburg; Soeren Terziadis
License

Attribution 4.0 (CC BY 4.0)https://creativecommons.org/licenses/by/4.0/
License information was derived automatically

Description

Traditionally, most schematic metro maps in practice as well as metro map layout algorithms adhere to an octolinear layout style with all paths composed of horizontal, vertical, and 45∘-diagonal edges. Despite growing interest in more general multilinear metro maps, generic algorithms to draw metro maps based on a system of k≥2 not necessarily equidistant slopes have not been investigated thoroughly. In this paper, we present and implement an adaptation of the octolinear mixed-integer linear programming approach of Nöllenburg and Wolff (2011) that can draw metro maps schematized to any set C of arbitrary orientations. We further present a data-driven approach to determine a suitable set C by either detecting the best rotation of an equidistant orientation system or by clustering the input edge orientations using a k-medians algorithm. We demonstrate the new possibilities of our method using several real-world examples.

Search
Clear search
Close search
Google apps
Main menu