Examinando por Materia "Graph"

Mostrando 1 - 5 de 5
  • No hay miniatura disponible
    Ítem
    An Entropy-Based Graph Construction Method for Representing and Clustering Biological Data
    (SPRINGER, 2019-10-01) Ariza-Jiménez L.; Pinel N.; Villa L.F.; Quintero O.L.; Universidad EAFIT. Departamento de Ciencias; Ciencias Biológicas y Bioprocesos (CIBIOP)
    Unsupervised learning methods are commonly used to perform the non-trivial task of uncovering structure in biological data. However, conventional approaches rely on methods that make assumptions about data distribution and reduce the dimensionality of the input data. Here we propose the incorporation of entropy related measures into the process of constructing graph-based representations for biological datasets in order to uncover their inner structure. Experimental results demonstrated the potential of the proposed entropy-based graph data representation to cope with biological applications related to unsupervised learning problems, such as metagenomic binning and neuronal spike sorting, in which it is necessary to organize data into unknown and meaningful groups. © 2020, Springer Nature Switzerland AG.
  • No hay miniatura disponible
    Ítem
    An Entropy-Based Graph Construction Method for Representing and Clustering Biological Data
    (SPRINGER, 2019-10-01) Ariza-Jiménez L.; Pinel N.; Villa L.F.; Quintero O.L.; Universidad EAFIT. Departamento de Ciencias; Biodiversidad, Evolución y Conservación
    Unsupervised learning methods are commonly used to perform the non-trivial task of uncovering structure in biological data. However, conventional approaches rely on methods that make assumptions about data distribution and reduce the dimensionality of the input data. Here we propose the incorporation of entropy related measures into the process of constructing graph-based representations for biological datasets in order to uncover their inner structure. Experimental results demonstrated the potential of the proposed entropy-based graph data representation to cope with biological applications related to unsupervised learning problems, such as metagenomic binning and neuronal spike sorting, in which it is necessary to organize data into unknown and meaningful groups. © 2020, Springer Nature Switzerland AG.
  • No hay miniatura disponible
    Ítem
    An Entropy-Based Graph Construction Method for Representing and Clustering Biological Data
    (SPRINGER, 2019-10-01) Ariza-Jiménez L.; Pinel N.; Villa L.F.; Quintero O.L.; Universidad EAFIT. Escuela de Ciencias; Modelado Matemático
    Unsupervised learning methods are commonly used to perform the non-trivial task of uncovering structure in biological data. However, conventional approaches rely on methods that make assumptions about data distribution and reduce the dimensionality of the input data. Here we propose the incorporation of entropy related measures into the process of constructing graph-based representations for biological datasets in order to uncover their inner structure. Experimental results demonstrated the potential of the proposed entropy-based graph data representation to cope with biological applications related to unsupervised learning problems, such as metagenomic binning and neuronal spike sorting, in which it is necessary to organize data into unknown and meaningful groups. © 2020, Springer Nature Switzerland AG.
  • No hay miniatura disponible
    Ítem
    Graph-based structural analysis of planar mechanisms
    (Springer Netherlands, 2017-01-01) Durango, S.; Correa, J.; Ruiz, O.E.; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAE
    Kinematic structure of planar mechanisms addresses the study of attributes determined exclusively by the joining pattern among the links forming a mechanism. The system group classification is central to the kinematic structure and consists of determining a sequence of kinematically and statically independent-simple chains which represent a modular basis for the kinematics and force analysis of the mechanism. This article presents a novel graph-based algorithm for structural analysis of planar mechanisms with closed-loop kinematic structure which determines a sequence of modules (Assur groups) representing the topology of the mechanism. The computational complexity analysis and proof of correctness of the implemented algorithm are provided. A case study is presented to illustrate the results of the devised method. © 2016, Springer Science+Business Media Dordrecht.
  • No hay miniatura disponible
    Ítem
    Graph-based structural analysis of planar mechanisms.
    (Springer Netherlands, 2016-03-03) Durango, Sebastian; Correa, Jorge; Ruiz Salguero, Oscar; Universidad EAFIT. Departamento de Ingeniería Mecánica. Grupo de Investigación CAD CAM CAE, Carrera 49 7 Sur-50, Medellín, Colombia.; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAE
    Kinematic structure of planar mechanisms addresses the study of attributes determined exclusively by the joining pattern among the links forming a mechanism. The system group classification is central to the kinematic structure and consists of determining a sequence of kinematically and statically independent-simple chains which represent a modular basis for the kinematics and force analysis of the mechanism. This article presents a novel graph-based algorithm for structural analysis of planar mechanisms with closed-loop kinematic structure which determines a sequence of modules (Assur groups) representing the topology of the mechanism. The computational complexity analysis and proof of correctness of the implemented algorithm are provided. A case study is presented to illustrate the results of the devised method.