2001
DOI: 10.1103/physrevlett.87.248701
|View full text |Cite
|
Sign up to set email alerts
|

Extracting Hidden Information from Knowledge Networks

Abstract: We develop a method allowing us to reconstruct individual tastes of customers from a sparsely connected network of their opinions on products, services, or each other. Two distinct phase transitions occur as the density of edges in this network is increased: Above the first, macroscopic prediction of tastes becomes possible; while above the second, all unknown opinions can be uniquely reconstructed. We illustrate our ideas using a simple Gaussian model, which we study using both field-theoretical methods and n… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

2
92
0

Year Published

2008
2008
2022
2022

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 98 publications
(94 citation statements)
references
References 6 publications
2
92
0
Order By: Relevance
“…In this particular case, we can compute the mean level spacing explicitly: 8) which converges to the WL Wigner surmise value for γ → ∞:…”
Section: The Wigner Surmise In the Bulkmentioning
confidence: 99%
See 1 more Smart Citation
“…In this particular case, we can compute the mean level spacing explicitly: 8) which converges to the WL Wigner surmise value for γ → ∞:…”
Section: The Wigner Surmise In the Bulkmentioning
confidence: 99%
“…It has since appeared in many different contexts, such as multivariate statistical data analysis [2], analysis of the capacity of channels with multiple antennae and receivers [3], low-energy Quantum Chromodynamics and other gauge theories [4,5], Quantum Gravity [6,7], knowledge networks [8], finance [9] and also in statistical physics problems, such as a class of (1 + 1)-dimensional directed polymer problems [10]. Very recent analytical results include statistics of large deviations for the maximum eigenvalue [11] and distributions related to entangled random pure states [12].…”
Section: Introductionmentioning
confidence: 99%
“…Representative recommending techniques developed by the computer science community include collaborative filtering [11,12], singular value decomposition [13,14], content-based analysis [15], latent semantic models [16], latent Dirichlet allocation [17], principle component analysis [18], and so on. Recently, physical perspectives and approaches have also found applications in designing recommendation algorithms, including iterative refinements [19][20][21], random-walk-based algorithms [22][23][24][25][26] and heat conduction algorithms [5,27]. Generally speaking, the performance of the above-mentioned algorithms can be further improved by using a hybrid method [28,29] or ensemble learning [30], or by exploiting additional information, like time [31] and tags [32].…”
Section: Introductionmentioning
confidence: 99%
“…Yet the first step will be to check, whether in such a context the power map will still provide the desired noise reduction (see [36] as well); thus in the next section we shall test, in a simple model, whether noise reduction by means of the power map is effective for singular correlation matrices. Next we proceed to the main part of our results, which will be to analyze the behavior of Wishart ensembles (WE) of singular matrices [38,39], including correlated Wishart ensembles (CWE), under the power map deformations.…”
Section: Introductionmentioning
confidence: 99%