Jiang X,Sun X,Hai Z.Graph-based algorithms for ranking researchers:not all swans are white[J].Scientometrics, 2013(3):743-759.Jiang X,Sun X,Zhuge H.Graph-based algorithms for ranking researchers:not all swans are white [J].Scientometrics,2013,96(3):743-759....
This paper presents an innovative unsupervised method for automatic sentence extraction using graph-based ranking algorithms. We evaluate the method in the context of a text summarization task, and show that the results obtained compare favorably with previously published results on established benchmarks...
Graph-based learning algorithms have been shown to be an effective approach for query-focused multi-document summarization (MDS). In this paper, we extend the standard graph ranking algorithm by proposing a two-layer (i.e. sentence layer and topic layer) graph-based semi-su...
to the PageRank and spectral clustering algorithms [5, 26], the optimal ranking of queries are computed by solving the following optimization problem: 2 Figure 2. Our graph model. The red line along the four sides indi- cates that all the boundary nodes are connected with each other. f ...
From our experiments, we show that not only does our algorithm outperform existing algorithms, but it can also obtain significant gains in cold start situations where relatively little information is known about a user or an item.doi:10.1007/978-3-642-35725-1_3Majdi Rawashdeh...
graph-based algorithms, create new approaches, and widen the usage of graphs. The target audience is comprised of researchers working on problems related to either Graph Theory or graph-based algorithms applied to Natural Language Processing, social media, and the Semantic Web....
在第一步找到这个相关产品之后,第二步就是ranking stage。我们可以用一些比较复杂的machine learning (ML) algorithms排序,去排刚刚找回来的这些relevant products。因为在这一步往往已经锁定了相关的产品,可能就是几千个,甚至有的时候就是几十个、几百个。那这种情况下,对于match set的东西,我们进行ranking的话,可以...
Premchaiswadi, W., Poompuang, P., Jongswat, N., et al.: Enhancing diversity-accuracy technique on user-based top-n recommendation algorithms. In: 2013 IEEE 37th Annual Computer Software and Applications Conference Workshops, pp. 403–408.https://doi.org/10.1109/COMPSACW.2013.68(2013) ...
For example, as shown in the lower part of Figure 1, in order to learn the concept of “minimal spanning tree” in the course of “Data structure and algorithms”, we should have prior knowledge of “graph” and “node”. So the concepts of “graph” and “node” are the prerequisites...
20050278325Graph-based ranking algorithms for text processing2005-12-15Mihalcea et al. 20050080775System and method for associating documents with contextual advertisements2005-04-14Colledge et al. 20030110158Search engine visibility system2003-06-12Seals et al. ...