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.
With the rapid development of intelligent transportation systems, modern society is at an unimaginable speed to produce massive data. How to make full use of valuable information in big data is particularly important. This paper summarizes the basic concepts of association rule mining and how to use the Apriori algorithm for correlation analysis in massive data. In addition, the Apriori algorithm...
In this paper, we present a method based on mining maximal frequent patterns for core-attachment complexes identification in yeast protein-protein interaction networks (PINs). Our method contains of two stages. Firstly, it finds all the protein-complex cores by mining maximal frequent patterns in PIN using FP-growth method. Then it filters the redundant cores and adds the attachment proteins for each...
In this paper, we propose an average-degree based cluster mining algorithm (ACM) for complexes detection in PPI networks. ACM method contains of three stages. Firstly, we make use of PPI network topology, i.e., average degree, to present a new quantitative function and then present a hierarchical algorithm to identify protein complexes. Finally, post-processing is applied to the predicted results...
PPI(Protein-protein interaction) networks decomposition is of great importance for understanding and detecting functional complexes in PPI networks. In this paper, we study spectral clustering for detecting protein complexes, focusing on two open issues in spectral clustering: (i) constructing similarity graphs; (ii) determining the number of clusters. Firstly, we study four similarity graphs to construct...
Objective: The study obtains gait feature of children with spastic cerebral palsy (SCP) by analysis of temporal and spatial parameters in stable walking and gait initiation (GI). Method: 24 children with SCP and 18 normally-developing (ND) children were tested by three-dimensional gait analysis system with normal walking speed. Velocity, duration, single support phase (SSP), double support phase (DSP),...
The prevention of pressure ulcers remains a significant problem in rehabilitation engineering, cushion takes an extra important role in the prevention of pressure sores for high-risk people who require wheelchairs for movements. The aim of this study was to design a cushion preventing pressure ulcers. A new efficient method to manufacture custom-contoured cushion (CCC) was proposed, and clinical research...
Accumulating evidence suggests that biological systems are composed of interacting, separable, functional modules-groups of vertices within which connections are dense but between which they are sparse. Identifying these modules is essential to understand the organization of biological systems. However, the most existing deterministic algorithms only find ldquodenserdquo clusters. Actually, the modules...
The paper gives an improved particle swarm optimal algorithm in which a kind of exponent decreasing inertia weights is given to improve the convergence speed and a kind of stochastic mutations is used to improve the diversity of the swarm in order to overcome the disadvantage of premature convergence and later period oscillatory occurrences. It is shown by five representative benchmarks functionpsilas...
Accumulating evidence suggests that biological systems are composed of interacting, separable, functional modules which is that groups of vertices within which connections are dense but between which they are sparse. Identifying these modules is likely to capture the biologically meaningful interactions. In recent years, many algorithms have been developed for detecting such structures. These algorithms...
In this paper, we give several properties related to highly connected graph. Based on these properties, we give a redefinition of highly connected subgraph which results in an algorithm for determining whether a given graph is highly connected in linear time. Then we present a computationally efficient algorithm, called MOHCS, for mining overlapping highly connected subgraphs. We experimentally evaluate...
The research of standardization and normalization of syndromes in traditional Chinese medicine (TCM) is the focal and difficult points of TCM, but always fails to make some breakthroughs. In this paper, we try to apply a new analysis method (entropy-based partition method for complex system) to conduct a standardized and normalized study on the TCM syndromes of "deficiency of Yin" syndrome...
When referred to functional motif discovery in biological network and drug target recognition in pharmaceutical chemistry, the most important step is to mine subgraphs with certain structure in a graph. Fortunately we notice that those kinds of subgraphs are frequently characterized by a Hamiltonian cycle. Hence, in this paper we develop a matrix theory based approach for mining such subgraphs. Firstly...
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.