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.
Most of the existing algorithms for mining frequent patterns could produce lots of projected databases and short patterns which could increase the time and memory cost of mining. In order to overcome such shortcoming, a fast and efficient algorithm named FBPM for mining frequent patterns in biological sequence is proposed. We first present the concept of primary pattern, and then use prefix tree for...
The preprocessing almost take half of the whole time in isosurface extraction of large-scale data, thus it will make sense to shorten the preprocessing time to improve visualization efficiency. We develop a new construction algorithm for binary interval tree nodes based on partitioning span space, and it reduce the sorting computation considerably in isosurface extraction preprocessing. Both complexity...
We consider the following tree-matching problem: Given labeled, ordered trees P and T, can P be obtained from T by deleting nodes? Deleting a node v entails removing all edges incident to v and, if v has a parent u, replacing the edges from u to v by edges from u to the children of v. This problem has a lot of applications in the computer engineering, such as XML tree pattern query evaluation, video...
The problem of face recognition was considered the most popular topic in artificial intelligence and computer vision. In this paper, we investigate face recognition based on graph kernels. We define the concept of max spanning tree, six graph kernels and a complicated kernel based on graph kernel and gray kernel. The result of our experiment shows that our spanning-tree kernels have significantly...
The increasing popularity of social networks has initiated a fertile research area in information extraction and data mining. Although such analysis can facilitate better understanding of sociological, behavioral, and other interesting phenomena, there is a growing concern about personal privacy being breached, thereby requiring effective anonymization techniques. In this paper, we consider edge weight...
The nearest neighbor query, to And the spatial entity whose distance to the given object, is a kind of basic operation on spatial dataset and used frequently in GIS. The DSB-tree adopts minimum bounding circle and maximum enclosed circle together to express the spatial entity approximately as a variation of SS-tree. Massive computing and comparisons on distance are necessary to the nearest neighbor...
In this paper, a new algorithm to find convex hull is presented which keeps the points into a form of nested binary tree. There are number of methods available for finding the convex hull but all of them are time consuming because they are based on comparing distances between the points and rotation of angles, whereas the proposed technique is based on binary tree which is efficient and more accurate...
In this paper, we present a novel method for fast data-driven construction of regression trees from temporal datasets including continuous data streams. The proposed mean output prediction tree (MOPT) algorithm transforms continuous temporal data into two statistical moments according to a user-specified time resolution and builds a regression tree for estimating the prediction interval of the output...
Broadcasting is an information dissemination problem in a connected network, in which one node, called the originator, disseminates a message to all other nodes by placing a series of calls along the communication lines of the network. Once informed, the nodes aid the originator in distributing the message. Finding the minimum broadcast time of a vertex in an arbitrary graph is NP-complete. The problem...
We consider the problem of data harvesting in wireless sensor networks. A designated collector node seeks to compute a function of the sensor measurements. For a directed graph G = (V ,??) on the sensor nodes, we wish to determine the optimal encoders on each edge which achieve zero-error block computation of the function at the collector node. Our goal is to characterize the rate region in R|??|...
A new physical layer network discovery approach is proposed based on tree-model which manages to solve the multi-subnet problem. According to the theory of maximum set and a set of formula, the method transforms the multi-subnet problem to single-subnet and simplifies the difficulty of the problem. The paper also figures out the critical value of the lost ratio which presents the completeness of the...
For improving matching precision, decreasing computational complexity of graph/hypergraph matching and integrating nodes structure information with feature similarity information, image registration algorithm based on sparse position hypergraph matching is proposed in this paper. Firstly, we construct the graph model through extracting features from real images. Secondly, after getting the minimum...
This paper presents a novel two-dimensional DGW structure (2D_PPCT). Then a new encoding scheme is proposed, which combines permutation encoding and 2D_PPCT. Experiment shows that the new scheme not only makes full use of the structural advantages of PPCT but has high coding efficiency of permutation encoding.
The attribute reduction algorithms designed by the method of discernibility matrix have lots of repeat and unnecessary elements in the discernibility matrix, which not only cost a mass of memory space, but also waste plenty of computing time for calculating attribute reduction. In order to improve the efficiency of such attribute reduction algorithm, by considering the idea of FP tree, a novel data...
In this paper, we consider theoretical and practical methods based on decompositions of constraint networks. We exploit the fact that decomposition-based methods can be used considering two steps. The first step is related to the (hyper)graphical decomposition (e.g. tree-decomposition or hyper tree-decomposition) while the second step exploits the decomposition to solve the CSPs. Thanks to this approach,...
The problem of searching all feedback loops of fuzzy cognitive map is equal to calculating all essential loops of a corresponding directed graph. In this paper, we present an algorithm for solving the feedback loop of fuzzy cognitive map. In the proposed method, we analyze the relationship between fuzzy cognitive map and directed graph, and utilize related knowledge of graph theory to obtain the corresponding...
This study's objective is to assess the performance of the common Prim and the Kruskal of the minimum spanning tree in building up super metric space. We proposed the use of complexity analysis and experimental methods to assess these two methods. After the analysis of the sample data of Shanghai and Shenzhen 300 index daily from the second half of 2005 to the second half of 2007, The results showed...
OVSF codes in the WCDMA system provide facility for variable data rate support. The applications with different rates must be served in fair manner. The paper propose a fair single code and multi code design so that the OVSF code tree is not over-served for single type of application. The single code design considers tree partitioning adaptive to the different user rates. The multi code design is...
In modal logics, graded (world) modalities have been deeply investigated as a useful framework for generalizing standard existential and universal modalities in such a way that they can express statements about a given number of immediately accessible worlds. These modalities have been recently investigated with respect to the mu-calculus, which have provided succinctness, without affecting the satisfiability...
The k-means algorithm is an extremely popular technique for clustering data. One of the major limitations of the k-means is that the time to cluster a given dataset D is linear in the number of clusters, k. In this paper, we employ height balanced trees to address this issue. Specifically, we make two major contributions, (a) we propose an algorithm, RACK (acronym for RApid Clustering using k-means),...
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.