The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Previous studies have revealed that gait rhythm fluctuations convey important information, which is useful for understanding certain types of neurodegenerative diseases such as Amyotrophic Lateral Sclerosis (ALS), Huntington’s disease (HD) and Parkinson’s disease (PD). However, previous investigations only focused on the locomotor patterns of each individual foot rather than the relations between...
In this paper, we aim to characterize hyper graphs in terms of structural complexities. To measure the complexity of a hyper graph in a straightforward way, we transform a hyper graph into a line graph which accurately reflects the multiple relationships exhibited by the hyper graph. To locate the dominant substructure within a line graph, we identify a centroid vertex by computing the minimum variance...
In recent work we have shown how to use the von Neumann entropy to construct a Jensen-Shannon kernel on graphs. The kernel is defined as the difference in entropies between a product graph and the separate graphs being compared. To develop this graph kernel further, in this paper we explore how to render the computation of the Jensen-Shannon kernel more efficient by using the information functionals...
In this paper, we aim to present a principled approach to the problem of depth-based complexity characterisation of graphs. Our idea is to decompose graphs into substructures of increasing size, and then to measure the complexity of these substructures using Shannon entropy or von-Neumann entropy. We commence by identifying the dominant vertex in a graph. From the dominant vertex, we construct subgraphs...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.