Clustering semi-structured dataset is a hot research topic recent years. In this paper, we proposed an algorithm named LESC to cluster XML documents collection by the leaf elements. First, we discuss the basic princip...
详细信息
To accurately and actively provide users with their potentially interested information or services is the main task of a recommender system. Collaborative filtering is one of the most widely adopted recommender method...
详细信息
To accurately and actively provide users with their potentially interested information or services is the main task of a recommender system. Collaborative filtering is one of the most widely adopted recommender methods, whereas it is suffering the issue of sparse rating data that will severely degenerate the quality of recommendations. To address this issue, the article proposes a novel method, named the FTRA (Fusing Trust and Ratings), trying to improve the performance of collaborative filtering recommendation by means of elaborately integrating twofold sparse information, i.e., the conventional rating data given by users and the social trust network among the same users. The performance of FTRA is rigorously validated by comparing it with six representative methods on a real-world dataset. The experimental results show that the FTRA outperforms all other competitors in terms of both precision and recall. More importantly, our work suggests that the strategy of augmenting sparse rating data by fusing trust networks does significantly improve the quality of conventional collaborative filtering recommendation, and its quality could be further improved by means of designing more effective integrating schemes.
In this paper, we introduce a hybrid optimization algorithm with the Branch-and-Bound Method and the Ant Colony Optimization to solve the multi-chromosomal reversal median problem. We convert the large-scale genome in...
详细信息
ISBN:
(纸本)9783037853245
In this paper, we introduce a hybrid optimization algorithm with the Branch-and-Bound Method and the Ant Colony Optimization to solve the multi-chromosomal reversal median problem. We convert the large-scale genome into TSP maps at first. Then we use a hybrid optimization algorithm with the Branch-and-Bound Method and the Ant Colony Optimization to solve the problem. In our improved algorithm, we increase the search speed by implement multi-branch parallel search of ACO. Our extensive experiments on simulated datasets show that this median solver is efficient.
OWL Ontologies may change continually to meet user's dynamic request and it may damage the integrity of the ontology. Thus, it is in urgent to propose an effective strategy to maintain the integrity of the continu...
详细信息
In this paper, we outline the problem of multi-join ordering query optimization in the semantic web scenario, also known as SPARQL BGP (Basic Graph Pattern) reordering optimization. Unlike most previous researches, we...
详细信息
In this paper, we outline the problem of multi-join ordering query optimization in the semantic web scenario, also known as SPARQL BGP (Basic Graph Pattern) reordering optimization. Unlike most previous researches, we concentrate on more general SPARQL query forms and devote ourselves to the problem of searching for the optimal query plan within a more complete search space-bushy plan space. We model the BGP reordering optimization as a genetic evolution problem and implement a genetic algorithm on the open-source Jena ARQ System. With carefully design of the chromosome encoding scheme and the cost model, the final experimental results show that our method outperforms the common heuristics method and is comparable with some other state-of-the-art optimization methods w.r.t. the output quality.
A performance evaluation model, weighted AUC (wAUC), is proposed to determine a better way to measure the imbalanced data learning classifiers. When computing the weighted area under the ROC curve, weights vary with t...
详细信息
Multi-objective decision-making problems have been widely applied to business, financial investment, transportation, optimal routing design, environment protection, and military strategies. In this paper, we give a no...
详细信息
作者：
LI YONG XU LUCollege of Mathematics
Key Laboratory of Symbolic computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012
In this paper, we study the persistence of lower dimensional tori for random Hamiltonian systems, which shows that majority of the unperturbed tori persist as Cantor fragments of lower dimensional ones under small per...
详细信息
In this paper, we study the persistence of lower dimensional tori for random Hamiltonian systems, which shows that majority of the unperturbed tori persist as Cantor fragments of lower dimensional ones under small perturbation. Using this result, we can describe the stability of the non-autonomous dynamic systems.
To satisfy the requirements of real-time and high quality mosaics, a bionic compound eye visual system was designed by simulating the visual mechanism of a fly compound eye. Several CCD cameras were used in this syste...
详细信息
To satisfy the requirements of real-time and high quality mosaics, a bionic compound eye visual system was designed by simulating the visual mechanism of a fly compound eye. Several CCD cameras were used in this system to imitate the small eyes of a compound eye. Based on the optical analysis of this system, a direct panoramic image mosaic algorithm was proposed. Several sub-images were collected by the bionic compound eye visual system, and then the system obtained the overlapping proportions of these sub-images and cut the overlap sections of the neighboring images. Thus, a panoramic image with a large field of view was directly mosaicked, which expanded the field and guaranteed the high resolution. The experimental results show that the time consumed by the direct mosaic algorithm is only 2.2% of that by the traditional image mosaic algorithm while guaranteeing mosaic quality. Furthermore, the proposed method effectively solved the problem of misalignment of the mosaic image and eliminated mosaic cracks as a result of the illumination factor and other factors. This method has better real-time properties compared to other methods.
Compared with traditional algorithms of rough set feature selection, the stochastic algorithms for feature selection based on rough set and swarm intelligence are popular. This paper gives the overview of rough set al...
详细信息
暂无评论