More actions
1 September 2024
- 14:3714:37, 1 September 2024 diff hist +19 Technical overview of the ratings system No edit summary
- 14:3314:33, 1 September 2024 diff hist +5 Internal:FromGitlab/Effect of Cycling in Trust Networks No edit summary current
- 14:3214:32, 1 September 2024 diff hist +51 Effect of cycling in trust networks No edit summary
- 14:3114:31, 1 September 2024 diff hist +4,555 N Effect of cycling in trust networks Created page with "This discussion will show how cycling in trust networks rapidly leads to an incorrect answer (Pcomb) which is often much higher than the answer you would get in a non-cycling network. The divergence between answers, however, depends on trust. If trust is low the answers will tend to converge and will be equal when trust is zero. If trust is high the answers will be very far apart. Suppose we have a trust network composed of four Nodes 0, 1, 2, 3 with the following conne..."
- 14:3014:30, 1 September 2024 diff hist +40 Technical overview of the ratings system No edit summary
31 August 2024
- 15:3515:35, 31 August 2024 diff hist +78 Technical overview of the ratings system No edit summary
- 15:3015:30, 31 August 2024 diff hist +559 Technical overview of the ratings system No edit summary
30 August 2024
- 21:4321:43, 30 August 2024 diff hist +119 Aggregation techniques No edit summary
- 21:3721:37, 30 August 2024 diff hist −35 Trust/Probability/Population graphs algorithm No edit summary
- 21:3621:36, 30 August 2024 diff hist −44 Trust/Probability/Population graphs algorithm No edit summary
- 21:3521:35, 30 August 2024 diff hist +33 Trust/Probability/Population graphs algorithm No edit summary
- 21:3421:34, 30 August 2024 diff hist +12 Internal:FromGitlab/More algorithms for the interface No edit summary current
- 21:3421:34, 30 August 2024 diff hist +9,823 N Trust/Probability/Population graphs algorithm Created page with "== Trust/Probability/Population Graphs Algorithm U99== This algorithm is a variant of Eric’s trust-weighted histogram (TWH) algorithm and can be conceived of as follows. Start by plotting probability on the x-axis and trust on the y-axis for each source. Now draw lines to represent intervals in the x and y-axis (eg 0-0.2, 0.2-0.4, etc). Each rectangle (ie bin) in the resulting grid will contain some..." Tag: Visual edit: Switched
- 21:3221:32, 30 August 2024 diff hist +98 Aggregation techniques No edit summary
- 21:2921:29, 30 August 2024 diff hist +4 Internal:FromGitlab/More algorithms for the interface No edit summary
- 21:2721:27, 30 August 2024 diff hist +36 Allowing for more than predicate questions in the trust-weighted histogram (TWH) algorithm No edit summary
- 21:2621:26, 30 August 2024 diff hist +5,954 N Allowing for more than predicate questions in the trust-weighted histogram (TWH) algorithm Created page with "The <code>trust_weighted_histogram</code> (TWH) algorithm was discussed last time but only handles predicate questions. Indeed, it only handles single valued probabilities under the assumption that the other probability in a predicate distribution is (1-P). Although the examples that exercise it are actually provided as a two-valued distribution [P, 1-P], the algorithm ignores the 2nd value. This was corrected using the <code>trust_weighted_histogram_sets</code> algorit..."
- 21:2521:25, 30 August 2024 diff hist +179 Trust-weighted histograms No edit summary
- 21:1921:19, 30 August 2024 diff hist +72 Privacy enhancing straight average algorithm No edit summary
- 21:1721:17, 30 August 2024 diff hist +146 A simple averaging technique to supplement the Bayes equation No edit summary
- 21:1421:14, 30 August 2024 diff hist +3,873 N Privacy enhancing straight average algorithm Created page with "The straight average algorithm discussed previously was modified to obscure trust information as it works up the tree, thus enhancing privacy. The previous algorithm communicated all trust-modified probabilities up to the head node, where the average would be calculated. This could potentially lead to reverse engineering the trust information associated with those probabilities. The new algorithm only communicates the sum of the probabilities at each node along with the..."
- 21:1321:13, 30 August 2024 diff hist +4 Internal:FromGitlab/More algorithms for the interface No edit summary
- 21:1121:11, 30 August 2024 diff hist +90 Aggregation techniques No edit summary
- 21:0421:04, 30 August 2024 diff hist +29 Aggregation techniques No edit summary
- 21:0121:01, 30 August 2024 diff hist +5 Internal:FromGitlab/Population Distributions No edit summary current
- 21:0121:01, 30 August 2024 diff hist +33 Population distributions and graphical output with privacy No edit summary
- 21:0121:01, 30 August 2024 diff hist +14,696 N Population distributions and graphical output with privacy Created page with "Last time we discussed probability distributions (either binned or continuous) in which each distribution was the result of a single source’s answer. We learned how to combine such distributions via Bayesian or averaging techniques. But another way to present respondents’ information is to simply transfer it to the top-most node and display it in a graphical or tabular form. The top node (the guy asking the..." Tag: Visual edit: Switched
- 21:0021:00, 30 August 2024 diff hist +6 Aggregation techniques No edit summary
- 20:5920:59, 30 August 2024 diff hist +63 Aggregation techniques No edit summary
- 20:5020:50, 30 August 2024 diff hist +5 Internal:FromGitlab/Binned and Continuous Distributions No edit summary current
- 20:5020:50, 30 August 2024 diff hist +14,463 N Binned and continuous distributions Created page with "{{Main|Aggregation techniques}} <h2>Introduction</h2> The simple predicate question we’ve been considering can be turned into one requiring a distribution, aka a probability density function. For example, if we ask whether it will be Sunny or Cloudy tomorrow the respondent can answer by saying: # Sunny or Cloudy. # % chance of each. This is, in a sense, the coarsest distribution possible and is the type of answer we have been considering so far. # An actual distribu..."
- 20:4920:49, 30 August 2024 diff hist +24 Aggregation techniques No edit summary
- 20:4220:42, 30 August 2024 diff hist +33 Trust-weighted histograms No edit summary
- 20:4120:41, 30 August 2024 diff hist +5 Internal:FromGitlab/Dan's proposal for trust weighted histograms No edit summary current
- 20:4020:40, 30 August 2024 diff hist +7,866 N Trust-weighted histograms Created page with "<span id="dans-proposal-for-trust-weighted-histograms"></span> === Dan’s proposal for trust-weighted histograms === This is my (@efrias) interpretation of an algorithm Dan proposed after the July 24th meeting. It behaves differently from previous algorithms: * the output of this algorithm is a histogram that could be presented to the user as-is * previous algorithms used the trust factor to pull stronger opinions towards the center. In other words, previous algorithm..." Tag: Visual edit: Switched
- 20:4020:40, 30 August 2024 diff hist +25 Aggregation techniques No edit summary
- 20:3320:33, 30 August 2024 diff hist +1 Other possible algorithms for calculating binary predicates No edit summary
- 20:3320:33, 30 August 2024 diff hist +5 Internal:FromGitlab/Other possible algorithms for calculating binary predicates No edit summary current
- 20:3220:32, 30 August 2024 diff hist +5,623 N Other possible algorithms for calculating binary predicates Created page with "{{Main|Aggregation techniques}} This is a work in progress, for now just look at it as a collection of notes. This is the original graph from example 1, just modified to show opinions as true/false with confidence values to avoid confusion. <kroki lang="graphviz"> digraph G { fontname="Helvetica,Arial,sans-serif" node [fontname="Helvetica,Arial,sans-serif"] edge [fontname="Helvetica,Arial,sans-serif"] layout=dot 0 [label="0, no opinion"] 1 [labe..."
- 20:3120:31, 30 August 2024 diff hist +67 Aggregation techniques No edit summary
- 20:3020:30, 30 August 2024 diff hist +58 Aggregation techniques No edit summary
- 20:1520:15, 30 August 2024 diff hist +33 A trust weighted averaging technique to supplement straight averaging and Bayes No edit summary
- 20:1420:14, 30 August 2024 diff hist +5 Internal:FromGitlab/A trust weighted averaging technique to supplement straight averaging and Bayes No edit summary current
- 20:1420:14, 30 August 2024 diff hist +9,619 N A trust weighted averaging technique to supplement straight averaging and Bayes Created page with "<h2>Brief Recap</h2> Last time we discussed a straightforward averaging technique for situations where Bayes was not appropriate. Probabilities were trust-modified (per [https://ceur-ws.org/Vol-1664/w9.pdf Sapienza ] or an augmented method) and passed up..." Tag: Visual edit: Switched
- 20:1320:13, 30 August 2024 diff hist +82 Aggregation techniques No edit summary
- 20:1120:11, 30 August 2024 diff hist 0 A simple averaging technique to supplement the Bayes equation No edit summary
- 20:0820:08, 30 August 2024 diff hist +5 Internal:FromGitlab/A simple averaging technique to supplement the Bayes equation No edit summary current
- 20:0820:08, 30 August 2024 diff hist +7,010 N A simple averaging technique to supplement the Bayes equation Created page with "{{Main:Aggregation techniques}} <h2>Background</h2> As we saw previously, the Bayes equation can easily be misapplied to situations that are not based on rigorous probabilistic studies. The example given was along the lines of 100 people who are not sure whether it will be sunny or cloudy tomorrow because either they individually don’t know (P=50%) or their probabilities cancel out to become 50%...." Tag: Visual edit: Switched
- 20:0720:07, 30 August 2024 diff hist +66 Aggregation techniques No edit summary
- 20:0620:06, 30 August 2024 diff hist +45 Aggregation techniques No edit summary