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.
We investigate the problem of summarizing frequent subgraphs by a smaller set of representative patterns. We show that some special graph patterns, called \delta\hbox{-}jump patterns in this paper, must be representative patterns. Based on the fact, we devise two algorithms, RP-FP and RP-GD, to mine a representative set that summarizes frequent subgraphs. RP-FP derives a representative set from frequent...
The particle swarm optimization (PSO) algorithm is vulnerable to reach local optimal value. So, this paper presents an adaptive hybrid particles swarm optimization. During the solving process, both crossover operator in genetic algorithm and hyper-mutation are introduced. Referring to the selection mechanism of immune algorithm based on information entropy, the adaptive selections mechanism is proposed...
A major challenge in frequent subgraph mining is the sheer size of its mining results. In many cases, allow minimum support may generate an explosive number of frequent subgraphs, which severely restricts the usage of frequent sub graph mining. In this paper, we study anew problem of mining frequent jump patterns from graph databases. Mining frequent jump patterns can dramatically reduce the number...
Sequence alignment algorithms, which are hardly to be efficient, are frequently used in protein sequences analysis. In order to improve the analyzing efficiency, an improved PST(Probabilistic Suffix Trees) model is proposed in this paper. Firstly, by analyzing the similarity between protein sequences analysis and sequences data mining, the idea of using PST model to analyze protein sequences is presented;...
The research proposes an approach of story segmentation for news video using multimodal analysis. The approach detects the topic-caption frames, and integrates them with silence clips detection, as well as shot segmentation to locate news story boundaries. On test data with 135,400 frames, the accuracy rate 87.9% and the recall rate 98.7% are obtained. The experimental results show the approach is...
Relay enhanced cellular (REC) system and orthogonal frequency division multiple access (OFDMA) technology are regarded as the key features of 4G communication systems. How to utilize resource wisely in OFDMA-based REC systems is an important and challenging research topic. This paper reviews the major issues in designing radio resource management (RRM) algorithms for REC systems. A new resource allocation...
A scheme for packaged granary grain quantity intelligent reckoning based on image processing was proposed in this paper. According to the actual scene, the grain bag characteristic outline -- the boundary of the counter-band of light was presented and taken as the analysis object. An algorithm combining Canny operator with image morphological thinning are used to extract the outline. Then, a counting...
Several efficient frequent subgraph mining algorithms have been recently proposed. However, the number of frequent graph patterns generated by these graph mining algorithms may be too large to be effectively explored by users, especially when the support threshold is low. In this paper, we propose to summarize frequent graph patterns by a much smaller number of representative graph patterns. Several...
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.