{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T10:38:09Z","timestamp":1753439889129,"version":"3.41.0"},"reference-count":59,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2013,5,1]],"date-time":"2013-05-01T00:00:00Z","timestamp":1367366400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N000140910032"],"award-info":[{"award-number":["N000140910032"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["IIS-0905672"],"award-info":[{"award-number":["IIS-0905672"]}],"id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Web"],"published-print":{"date-parts":[[2013,5]]},"abstract":"<jats:p>\n            Deep web search engines face the formidable challenge of retrieving high-quality results from the vast collection of searchable databases. Deep web search is a two-step process of selecting the high-quality sources and ranking the results from the selected sources. Though there are existing methods for both the steps, they assess the relevance of the sources and the results using the query-result similarity. When applied to the deep web these methods have two deficiencies. First is that they are agnostic to the correctness (trustworthiness) of the results. Second, the query-based relevance does not consider the importance of the results and sources. These two considerations are essential for the deep web and open collections in general. Since a number of deep web sources provide answers to any query, we conjuncture that the agreements between these answers are helpful in assessing the importance and the trustworthiness of the sources and the results. For assessing source quality, we compute the agreement between the sources as the agreement of the answers returned. While computing the agreement, we also measure and compensate for the possible\n            <jats:italic>collusion<\/jats:italic>\n            between the sources. This adjusted agreement is modeled as a graph with sources at the vertices. On this agreement graph, a quality score of a source, that we call\n            <jats:italic>SourceRank<\/jats:italic>\n            , is calculated as the stationary visit probability of a random walk. For ranking results, we analyze the second-order agreement between the results. Further extending SourceRank to multidomain search, we propose a source ranking sensitive to the query domains. Multiple domain-specific rankings of a source are computed, and these ranks are combined for the final ranking. We perform extensive evaluations on online and hundreds of Google Base sources spanning across domains. The proposed result and source rankings are implemented in the deep web search engine\n            <jats:italic>Factal<\/jats:italic>\n            . We demonstrate that the agreement analysis tracks source corruption. Further, our relevance evaluations show that our methods improve precision significantly over Google Base and the other baseline methods. The result ranking and the domain-specific source ranking are evaluated separately.\n          <\/jats:p>","DOI":"10.1145\/2460383.2460390","type":"journal-article","created":{"date-parts":[[2013,6,5]],"date-time":"2013-06-05T12:09:34Z","timestamp":1370434174000},"page":"1-32","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Assessing relevance and trust of the deep web sources and results based on inter-source agreement"],"prefix":"10.1145","volume":"7","author":[{"given":"Raju","family":"Balakrishnan","sequence":"first","affiliation":[{"name":"Arizona State University"}]},{"given":"Subbarao","family":"Kambhampati","sequence":"additional","affiliation":[{"name":"Arizona State University"}]},{"given":"Manishkumar","family":"Jha","sequence":"additional","affiliation":[{"name":"Arizona State University"}]}],"member":"320","published-online":{"date-parts":[[2013,5,29]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526777"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872799"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772801"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963192.1963284"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963440"},{"volume-title":"Proceedings of the 23rd IEEE International Conference on Data Engineering (ICDE'07)","author":"Barbosa L.","key":"e_1_2_1_6_1"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1076034.1076049"},{"volume-title":"Proceedings of the 18th International Conference on Data Engineering (ICDE'02)","author":"Bhalotia G.","key":"e_1_2_1_8_1"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/382979.383040"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/215206.215328"},{"volume-title":"Proceedings of the 13th International Conference on Very Large Data Bases-Volume 30","author":"Chaudhuri S.","key":"e_1_2_1_12_1"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/276305.276323"},{"volume-title":"Proceedings of the Workshop on Information Integration on the Web (IIWeb'03)","author":"Cohen W.","key":"e_1_2_1_14_1"},{"key":"e_1_2_1_15_1","first-page":"1","article-title":"Combining approaches to information retrieval","volume":"7","author":"Croft W.","year":"2000","journal-title":"Adv. Inf. Retr."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247550"},{"key":"e_1_2_1_17_1","unstructured":"DMOZ Movies 2011. Open directory project movies. http:\/\/www.dmoz.org\/Arts\/Movies\/Titles\/.  DMOZ Movies 2011. Open directory project movies. http:\/\/www.dmoz.org\/Arts\/Movies\/Titles\/."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1921008"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687690"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1969.10501049"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/314516.314517"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718504"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772730"},{"key":"e_1_2_1_24_1","unstructured":"Google Products. 2011. Google products. http:\/\/www.google.com\/products.  Google Products. 2011. Google products. http:\/\/www.google.com\/products."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/635484.635485"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963192.1963219"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2031331.2031341"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963192.1963220"},{"volume":"30","volume-title":"Proceedings of the 13th International Conference on Very Large Databases --","author":"Gyongyi Z.","key":"e_1_2_1_29_1"},{"volume-title":"Proceedings of the Workshop on Management of Semistructured Data. ACM Press","author":"Hammer J.","key":"e_1_2_1_30_1"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2003.1208999"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872784"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1031171.1031178"},{"key":"e_1_2_1_34_1","unstructured":"IMDB 2011. IMDB movie database. http:\/\/www.imdb.com.  IMDB 2011. IMDB movie database. http:\/\/www.imdb.com."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007655"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324140"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142599"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1076034.1076087"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/278459.258587"},{"key":"e_1_2_1_40_1","first-page":"913","article-title":"Agreement-based learning","volume":"20","author":"Liang P.","year":"2008","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2005.39"},{"key":"e_1_2_1_42_1","first-page":"4","article-title":"Structured data meets the web: A few observations","volume":"31","author":"Madhavan J.","year":"2006","journal-title":"Data Engin. Bull."},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.14778\/1454159.1454163"},{"volume-title":"Proceedings of the 20th International Conference on Data Engineering (ICDE'04)","author":"Nie Z.","key":"e_1_2_1_44_1"},{"key":"e_1_2_1_45_1","unstructured":"Nyt Movie Guide. 2010. New York times guide to best 1000 movies. http:\/\/www.nytimes.com\/ref\/movies\/1000best.html.  Nyt Movie Guide. 2010. New York times guide to best 1000 movies. http:\/\/www.nytimes.com\/ref\/movies\/1000best.html."},{"key":"e_1_2_1_46_1","unstructured":"Nyt Top Books. 2010. New york times books best sellers. http:\/\/www.hawes.com\/number1s.htm.  Nyt Top Books. 2010. New york times books best sellers. http:\/\/www.hawes.com\/number1s.htm."},{"key":"e_1_2_1_47_1","unstructured":"Pbase Cameras. 2011. Pbase camera list. http:\/\/www.pbase.com\/cameras.  Pbase Cameras. 2011. Pbase camera list. http:\/\/www.pbase.com\/cameras."},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242643"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277827"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/860435.860490"},{"key":"e_1_2_1_51_1","unstructured":"UIUC TEL-8. 2003. UIUC tel-8 repository. http:\/\/metaquerier.cs.uiuc.edu\/repository\/datasets\/tel-8\/index.html.  UIUC TEL-8. 2003. UIUC tel-8 repository. http:\/\/metaquerier.cs.uiuc.edu\/repository\/datasets\/tel-8\/index.html."},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/775152.775179"},{"volume":"30","volume-title":"Proceedings of the 13th International Conference on Very Large Databases.","author":"Wang J.","key":"e_1_2_1_53_1"},{"key":"e_1_2_1_54_1","unstructured":"Wiki Top Music. 2011. Best selling albums worldwide. http:\/\/en.wikipedia.org\/wiki\/List_of_best-selling_albums_worldwide.  Wiki Top Music. 2011. Best selling albums worldwide. http:\/\/en.wikipedia.org\/wiki\/List_of_best-selling_albums_worldwide."},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-009-0155-0"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/1400181.1400187"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281309"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963439"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060761"}],"container-title":["ACM Transactions on the Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2460383.2460390","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2460383.2460390","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:23Z","timestamp":1750235963000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2460383.2460390"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5]]},"references-count":59,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["10.1145\/2460383.2460390"],"URL":"https:\/\/doi.org\/10.1145\/2460383.2460390","relation":{},"ISSN":["1559-1131","1559-114X"],"issn-type":[{"type":"print","value":"1559-1131"},{"type":"electronic","value":"1559-114X"}],"subject":[],"published":{"date-parts":[[2013,5]]},"assertion":[{"value":"2011-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-12-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-05-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}