Reference health

Link Prediction Based on Graph Topology: The Predictive Value of Generalized Clustering Coefficient

https://doi.org/10.2139/ssrn.1634014
CiteStamped reference-health badge
2 of 43 checkable references need attention · checked 2026-08-27

At the dated check, the references listed below either did not resolve in Crossref or DataCite, or carried a retraction notice. Each one is shown with the registry record that put it there.

14 without a DOI — not checked. A reference deposited without a DOI is never matched by title or guessed at; it stays outside the checked set, and this line discloses that.

References needing attention

does not resolve to a known work10.1145/956958.956972
does not resolve to a known work10.1145/775085.775087
The 41 checked references that resolve
resolves10.1109/2.901170
Using data mining methods to build customer profiles
resolves10.1109/tkde.2005.99
Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions
resolves10.1103/revmodphys.74.47
Statistical mechanics of complex networks
resolves10.1145/380752.380859
Spectral analysis of data
resolves10.1016/s0031-3203(96)00142-2
The use of the area under the ROC curve in the evaluation of machine learning algorithms
resolves10.1002/(sici)1097-4571(199506)46:5<348::aid-asi6>3.0.co;2-1
An algorithmic approach to concept exploration in a large knowledge network (automatic thesaurus consultation): Symbolic branch-and-bound search vs. connectionist Hopfield net activation
resolves10.1038/nature06830
Hierarchical structure and the prediction of missing links in networks
resolves10.1145/963770.963776
Item-based top- <i>N</i> recommendation algorithms
resolves10.1145/502512.502525
Mining the network value of customers
resolves10.1007/978-3-662-04599-2
Relational Data Mining
resolves10.5486/PMD.1959.6.3-4.12
On random graphs. I.
resolves10.1016/s0378-4371(02)01336-5
Higher order clustering coefficients in Barabási–Albert networks
resolves10.1145/959242.959253
Link mining
resolves10.1142/s0219525901000140
RELEVANT CYCLES IN CHEMICAL REACTION NETWORKS
resolves10.1073/pnas.0735871100
Assessing experimentally derived interactions in a small world
resolves10.1023/A:1011419012209
Eigentaste: A Constant Time Collaborative Filtering Algorithm
resolves10.1145/63039.63044
Probabilistic and genetic algorithms in document retrieval
resolves10.1148/radiology.148.3.6878708
A method of comparing the areas under receiver operating characteristic curves derived from the same cases.
resolves10.1145/963770.963772
Evaluating collaborative filtering recommender systems
resolves10.1145/223904.223929
Recommending and evaluating choices in a virtual community of use
resolves10.1145/312624.312649
Probabilistic latent semantic indexing
resolves10.1145/963770.963774
Latent semantic models for collaborative filtering
resolves10.1145/963770.963775
Applying associative retrieval techniques to alleviate the sparsity problem in collaborative filtering
resolves10.1287/ijoc.1080.0292
The Time-Series Link Prediction Problem with Applications in Communication Surveillance
resolves10.2139/ssrn.906513
A Unified Recommendation Framework Based on Probabilistic Relational Models
resolves10.1109/MIS.2007.4338497
A Comparison of Collaborative-Filtering Recommendation Algorithms for E-commerce
resolves10.1109/sfcs.1998.743517
Recommendation systems: a probabilistic analysis
resolves10.1145/1150402.1150479
Sampling from large graphs
resolves10.1023/A:1013284820704
Efficient Adaptive-Support Association Rule Mining for Recommender Systems
resolves10.1023/A:1021819901281
Studying Recommendation Algorithms by Graph Analysis
resolves10.1137/s003614450342480
The Structure and Function of Complex Networks
resolves10.1103/physreve.64.026118
Random graphs with arbitrary degree distributions and their applications
resolves10.1145/245108.245121
Recommender systems
resolves10.1145/775047.775057
Mining knowledge-sharing sites for viral marketing
resolves10.1109/tcs.1978.1084515
Enumerating all simple paths in a graph
resolves10.1145/62437.62447
On the use of spreading activation methods in automatic information
resolves10.21236/ada439541
Application of Dimensionality Reduction in Recommender System - A Case Study
resolves10.7155/jgaa.00108
Approximating Clustering Coefficient and Transitivity
resolves10.1103/physreve.70.056115
Random networks with tunable degree distribution and clustering
resolves10.1038/30918
Collective dynamics of ‘small-world’ networks
resolves10.7551/mitpress/7503.003.0199
Stochastic Relational Models for Discriminative Link Prediction
The 14 references without a DOI — listed, not checked
no DOI — not checkedEmergence of scaling in random networks
no DOI — not checkedEmpirical analysis of predictive algorithms for collaborative filtering
no DOI — not checkedPersistence and periodicity in a dynamic proximity network
no DOI — not checkedLearning probabilistic models of link structure
no DOI — not checkedDependency networks for inference, collaborative filtering, and data visualization
no DOI — not checkedA link analysis approach to recommendation with sparse data
no DOI — not checkedProbabilistic frame-based systems
no DOI — not checkedStatistical relational learning for link prediction
no DOI — not checkedGroupLens: An open architecture for collaborative filtering of netnews
no DOI — not checkedref46
no DOI — not checkedSocial information filtering: Algorithms for automating word of mouth
no DOI — not checkedThe Enron dataset database schema and brief statistical report
no DOI — not checkedA formal statistical approach to collaborative filtering
no DOI — not checkedref56
What this badge says. CiteStamped means the CHECKABLE references of this work were clean at the dated check: each resolved to a known work in a public registry, and none carried a retraction notice at that time. It says nothing about the quality, findings, or importance of the work itself, and nothing about references deposited without a DOI.

checked 2026-08-27 — re-checked daily as this page is visited; titles and statuses come from Crossref and DataCite and are not part of the signed record

Embed this badge

Both snippets point at the live badge image and link back to this page. The badge re-renders from the daily check, so an embed never goes stale by more than a day of visits.

<a href="https://citestamp.com/citestamped/10.2139/ssrn.1634014"><img src="https://citestamp.com/citestamped/10.2139/ssrn.1634014/badge.svg" alt="CiteStamped reference-health badge" width="460" height="64"></a>
[![CiteStamped reference-health badge](https://citestamp.com/citestamped/10.2139/ssrn.1634014/badge.svg)](https://citestamp.com/citestamped/10.2139/ssrn.1634014)