Combining Information from Multiple Internet Sources

More documents

Recommendations

Info

Table of listings Listing 3.1.1 Definition of the normal form game.............................................................................21 Listing 3.1.2 Example of Game theory round flow process ..............................................................23 Listing 3.1.3 Continuation of the example of Game theory round flow process...............................24 Listing 3.1.4 Game theory main algorithm........................................................................................25 Listing 3.2.1 Example of Auction method flow process....................................................................29 Listing 3.2.2 Continuation of the example of Auction round flow process .......................................30 Listing 3.2.3 Auction method main algorithm ...................................................................................31 Listing 3.3.1 Consensus method main algorithm...............................................................................33 Listing 3.3.2 Algorithm evaluating consensus consistency ...............................................................34 Listing 3.3.3 Weights calculation algorithm for Consensus method..................................................35 Listing 3.4.1 URL ranking algorithm for Game theory and Auction methods ..................................38 Listing 3.4.2 Weights calculation for Game theory and Auction methods.........................................39 Listing 3.4.3 Example of variation of algorithm for Levenshtein distance .......................................40 Listing 3.4.4 Pseudo code of variation of algorithm for Levenshtein distance .................................41 Table of figures Fig 3.1.1 Game theory Method Activity Diagram .............................................................................27 Fig 3.2.1 Auction Method Activity Diagram......................................................................................32 Fig 3.3.1 Consensus Method Activity Diagram.................................................................................36 Table of tables Table 4.1.1 Results of Auction method and search engines for simple query....................................44 Table 4.1.2 Coverage of results of Auction method with the search engines for simple query .........44 Table 4.1.3 Results of Game theory method and search engines for simple query ...........................46 Table 4.1.4 Coverage of results of Game theory method and search engines for simple query........46 Table 4.1.5 Results of Consensus method and search engines for simple query...............................47 Table 4.1.6 Coverage of results of Consensus method and search engines for simple query............48 Table 4.1.7 Results of methods and MySpiders system for simple query..........................................49 Table 4.1.8 Coverage of methods’ results ..........................................................................................49 Table 4.1.9 Coverage of methods’ results and results of MySpiders system for simple query..........50 Table 4.2.1 Results of Auction method and search engines for more complex query .......................52 Table 4.2.2 Coverage of results of Auction method and search engines for more complex query....52 Table 4.2.3 Results of Game theory method and search engines for more complex query...............54 Table 4.2.4 Coverage of Game theory method and search engines for more complex query ...........54 Table 4.2.5 Results of Consensus method and search engines for more complex query...................56 Table 4.2.6 Coverage of Consensus method and search engines for more complex query ...............56 Table 4.2.7 Results of methods and MySpiders system for more complex query .............................57 Table 4.2.8 Coverage of methods for more complex query...............................................................57 Table 4.2.9 Coverage of methods and MySpiders system for more complex query..........................58 Table 4.3.1 Results of Auction method and search engines for very complex query ........................61 Table 4.3.2 Coverage of Auction method and search engines for very complex query.....................61 Table 4.3.3 Results of Game theory method and search engines for very complex query................63 Table 4.3.4 Coverage of Game theory method and search engines for very complex query.............63 Table 4.3.5 Results of Consensus method and search engines for very complex query....................65 Table 4.3.6 Coverage of Consensus method and search engines for very complex query ................65 Table 4.3.7 Results of methods for very complex query ...................................................................66 Table 4.3.8 Coverage of methods for very complex query................................................................67 72
Warszawa, dnia 21.04.2008r. Oświadczenie Oświadczam, że pracę magisterską pod tytułem; „Combining Information from Multiple Internet Sources”, której promotorem jest dr Marcin Paprzycki, wykonałem samodzielnie, co poświadczam własnoręcznym podpisem. .......................................... 73
Page 1 and 2:
WARSAW UNIVERSITY OF TECHNOLOGY FAC
Page 3 and 4:
POLITECHNIKA WARSZAWSKA WYDZIAŁ MA
Page 5 and 6:
Combining Information from Multiple
Page 7 and 8:
Table of contents 1. Introduction..
Page 9 and 10:
application presented in this paper
Page 11 and 12:
2. Design of the tool used for test
Page 13 and 14:
2.2.1 Design of the Client module 2
Page 15 and 16:
module. At the end of this section
Page 17 and 18:
there are set up search engines. Af
Page 19 and 20:
UTILITY CLASSES: AgentController -
Page 21 and 22:
) If initial step of the algorithm
Page 23 and 24:
2.3 Design of the database part Thi
Page 25 and 26:
Table search_engine: This table con
Page 27 and 28: 3. Algorithms This part of the thes
Page 29 and 30: Example: Let us consider the follow
Page 31 and 32: During algorithm processing there i
Page 33 and 34: Fig 3.1.1 Game theory Method Activi
Page 35 and 36: Example: Consider the following ini
Page 37 and 38: Listing 3.2.3 presents the pseudo c
Page 39 and 40: 3.3 Consensus method The Consensus
Page 41 and 42: Depending on the outcome of the con
Page 43 and 44: 3.4 Common algorithms This part of
Page 45 and 46: is multiplied by 0.01. 3 If the alg
Page 47 and 48: Input: Two lists with URLs Output:
Page 49 and 50: 4.1 Tests with simple query Followi
Page 51 and 52: top enough positions in all result
Page 53 and 54: The following section presents resu
Page 55 and 56: This part will present comparison o
Page 57 and 58: As the first URL MySpiders returns
Page 59 and 60: was yield. However most of the retu
Page 61 and 62: The following part presents compari
Page 63 and 64: The following part presents compari
Page 65 and 66: complexity of the query. As the fir
Page 67 and 68: 7 http://www.calresco.org/lucas/pmo
Page 69 and 70: 5 6 http://www.virtualschool.edu/mo
Page 71 and 72: 10 http://www.mises.org/story/2451
Page 73 and 74: Auction Consensus Game theory Aucti
Page 75 and 76: 5. Final remarks In this thesis app
Page 77: [15] Kessler R.R., Griss M.L., Maki
show all

Combining Information from Multiple Internet Sources

Create successful ePaper yourself

Delete template?

Save as template?