With the expansion of the Web, automatically organizing large scale text resources, e.g. Web pages, becomes very important. Many Web sites, like Google and Yahoo, use hierarchical classification trees to organize text...
详细信息
A mathematical framework based on probability theory is presented that enables us to analyze one important aspect of SI algorithms: the population diversity. Firstly the population density degree is defined for the po...
详细信息
We describe for dependency parsing an annotation adaptation strategy, which can automatically transfer the knowledge from a source corpus with a different annotation standard to the desired target parser, with the sup...
详细信息
Thinning algorithms can be classified into two general types: serial and parallel algorithms. Several algorithms have been proposed, but they have limitations. A new thinning algorithm based on the centroid of the blo...
详细信息
Tree-based statistical machine translation models have made significant progress in recent years, especially when replacing 1-best trees with packed forests. However, as the parsing accuracy usually goes down dramatic...
详细信息
In our daily life, more and more commercial activities that have traditionally been conducted via physical mechanisms are being conducted virtually by means of information technologies (ITs). With the tendency of incr...
详细信息
Manually annotated corpora are valuable but scarce resources, yet for many annotation tasks such as treebanking and sequence lab.ling there exist multiple corpora with different and incompatible annotation guidelines ...
详细信息
Jointly parsing two languages has been shown to improve accuracies on either or both sides. However, its search space is much bigger than the monolingual case, forcing existing approaches to employ complicated modelin...
详细信息
The paper proposes a novel memory-based collab.rative filtering algorithm-Multi-lab.l Probabilistic Latent Semantic Analysis based Collab.rative Filtering, which improves the quality of recommendations by reducing the...
详细信息
The paper proposes a novel memory-based collab.rative filtering algorithm-Multi-lab.l Probabilistic Latent Semantic Analysis based Collab.rative Filtering, which improves the quality of recommendations by reducing the dimension of the user-rating-data matrix by multi-lab.l probabilistic latent semantic analysis when the matrix is extremely sparse. Firstly, it confines the set of latent variables of probability latent semantic analysis to the set of multi-lab.l of items to make latent variables have meanings of corresponding lab.ls. Then it learns the probabilistic distribution of latent variables, i.e., the model of use's interest, to compress the user-rating-data matrix. Finally, it computes the similarity between different users based on the above learned model and makes recommendations. Compared to memory-based collab.rative filtering algorithms, the proposed algorithm decreases the mean absolute error 4 percents averagely on test dataset by reducing the dimension of the user-rating-data matrix. The proposed algorithm makes the recommendation system understandable and obtains competitive recommendations compared to the filtering algorithm which reduces the dimension of the user-rating-data matrix by probabilistic latent semantic analysis.
Many researchers of swarm intelligence (SI) algorithms take their ideas from physical and biological systems. This approach, however, is mostly qualitative and many ideas remain vague and ill-defined. In this paper, a...
详细信息
暂无评论