2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2012
DOI: 10.1109/asonam.2012.82
|View full text |Cite
|
Sign up to set email alerts
|

Fast Recommendation on Bibliographic Networks

Abstract: Abstract-Graphs and matrices are widely used in algorithms for social network analyses. Since the number of interactions is much less than the possible number of interactions, the graphs and matrices used in the analyses are usually sparse. In this paper, we propose an efficient implementation of a sparsematrix computation which arises in our publicly available citation recommendation service called theadvisor. The recommendation algorithm uses a sparse matrix generated from the citation graph. We observed tha… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 16 publications
(8 citation statements)
references
References 27 publications
0
8
0
Order By: Relevance
“…An article's cumulative reviewability is the log (base 2) of the sum of all such co-citation counts. This yields results analogous to certain effective citation recommendation systems (e.g., Küçüktunç et al 2012;Zhou et al 2008). The variable is standardized to make its effect interpretable.…”
Section: Appendix Fundingmentioning
confidence: 98%
“…An article's cumulative reviewability is the log (base 2) of the sum of all such co-citation counts. This yields results analogous to certain effective citation recommendation systems (e.g., Küçüktunç et al 2012;Zhou et al 2008). The variable is standardized to make its effect interpretable.…”
Section: Appendix Fundingmentioning
confidence: 98%
“…Note that P transition matrix of random walk-based methods is built using A and p * ; however, the edge weights in rows can be stored and read more efficiently with A in practice [Kucuktunc et al 2012a]. Figure 2 shows that the direction-awareness parameter κ can be adjusted to reach papers from different years with a range from late 1980's to 2010 for almost all values of d. In our online service, the parameter κ can be set to a value of user's preference.…”
Section: Pagerank Personalized Pagerank and Direction-aware Personamentioning
confidence: 99%
“…Note that P transition matrix of random walk-based methods is built using A and p * ; however, the edge weights in rows can be stored and read more efficiently with A in practice [Kucuktunc et al 2012a].…”
Section: Problem Definitionmentioning
confidence: 99%
See 1 more Smart Citation
“…TheAdvisor [6] is a recommendation system which takes a partial list of the bibliography as the input query. TheAdvisor expends the partial list of the bibliography using citation graph information.…”
Section: Existing Systemsmentioning
confidence: 99%