@inproceedings{conf/sigir/Balog07, title = {People search in the enterprise.}, author = {Krisztian Balog}, booktitle = {SIGIR}, crossref = {conf/sigir/2007}, editor = {Wessel Kraaij and Arjen P. de Vries and Charles L. A. Clarke and Norbert Fuhr and Noriko Kando}, pages = {916}, publisher = {ACM}, url = {http://dblp.uni-trier.de/db/conf/sigir/sigir2007.html#Balog07}, year = {2007}, biburl = {http://www.bibsonomy.org/bibtex/2bb843129e1e43746deccd244e19608c2/ewomant}, description = {dblp}, date = {2007-08-24}, ee = {http://doi.acm.org/10.1145/1277741.1277985}, isbn = {978-1-59593-597-7}, keywords = {enterprise search social_navigation social_software socialnetworking vertical_search } } @inproceedings{conf/sigir/RowlandsHS07, title = {Workload sampling for enterprise search evaluation.}, author = {Tom Rowlands and David Hawking and Ramesh S. Sankaranarayana}, booktitle = {SIGIR}, crossref = {conf/sigir/2007}, editor = {Wessel Kraaij and Arjen P. de Vries and Charles L. A. Clarke and Norbert Fuhr and Noriko Kando}, pages = {887-888}, publisher = {ACM}, url = {http://dblp.uni-trier.de/db/conf/sigir/sigir2007.html#RowlandsHS07}, year = {2007}, biburl = {http://www.bibsonomy.org/bibtex/26de3bb7a0b08cb0f2da7f405cf6f9087/ewomant}, description = {dblp}, date = {2007-08-24}, ee = {http://doi.acm.org/10.1145/1277741.1277959}, isbn = {978-1-59593-597-7}, keywords = {enterprise evaluation information_retrieval vertical_search } } @inproceedings{conf/sigir/OBrienA07, title = {Focused ranking in a vertical search engine.}, author = {Philip O'Brien and Tony Abou-Assaleh}, booktitle = {SIGIR}, crossref = {conf/sigir/2007}, editor = {Wessel Kraaij and Arjen P. de Vries and Charles L. A. Clarke and Norbert Fuhr and Noriko Kando}, pages = {912}, publisher = {ACM}, url = {http://dblp.uni-trier.de/db/conf/sigir/sigir2007.html#OBrienA07}, year = {2007}, biburl = {http://www.bibsonomy.org/bibtex/2dfc9a12199b935059cab760354596f29/ewomant}, description = {dblp}, date = {2007-08-24}, ee = {http://doi.acm.org/10.1145/1277741.1277980}, isbn = {978-1-59593-597-7}, keywords = {Ranking information_retrieval to_download vertical_search } } @inproceedings{cummins:2005:CIKM, title = {An evaluation of evolved term-weighting schemes in information retrieval}, address = {Bremen, Germany}, author = {Ronan Cummins and Colm O'Riordan}, booktitle = {CIKM '05: Proceedings of the 14th ACM international conference on Information and knowledge management}, editor = {Otthein Herzog and Hans-Jorg Schek and Norbert Fuhr and Abdur Chowdhury and Wilfried Teiken}, month = {31 October - 5 November}, pages = {305--306}, publisher = {ACM press}, url = {http://portal.acm.org/citation.cfm?doid=1099639}, year = {2005}, biburl = {http://www.bibsonomy.org/bibtex/24d265e86c0f3c6479df83c7ab99c4ac8/brazovayeye}, abstract = {presents an evaluation of evolved term-weighting schemes on short, medium and long TREC queries. A previously evolved global (collection-wide) term-weighting scheme is evaluated on unseen TREC data and is shown to increase mean average precision over idf. A local (within-document) evolved term-weighting scheme is presented which is dependent on the best performing global scheme. The full evolved scheme (i.e. the combined local and global scheme) is compared to both the BM25 scheme and the Pivoted Normalisation scheme. Our results show that the local evolved solution does not perform well on some collections due to its document normalisation properties and we conclude that Okapi-tf can be tuned to interact effectively with the evolved global weighting scheme presented and increase mean average precision over the standard BM25 scheme.}, organisation = {ACM}, publisher_address = {New York, NY, USA}, order_no = {605050}, size = {2 pages}, isbn = {1-59593-140-6}, notes = {Proceedings of the 14th ACM international conference on Information and knowledge management}, keywords = {Poster Session algorithms, genetic information programming, retrieval, term-weighting, } } @inproceedings{conf/sigir/WuLW07, title = {Probability ranking principle via optimal expected rank.}, author = {Ho Chung Wu and Robert W. P. Luk and K. F. Wong}, booktitle = {SIGIR}, crossref = {conf/sigir/2007}, editor = {Wessel Kraaij and Arjen P. de Vries and Charles L. A. Clarke and Norbert Fuhr and Noriko Kando}, pages = {713-714}, publisher = {ACM}, url = {http://dblp.uni-trier.de/db/conf/sigir/sigir2007.html#WuLW07}, year = {2007}, biburl = {http://www.bibsonomy.org/bibtex/2e62d958a6de6d95ce531c2bb3c7cae1d/dblp}, description = {dblp}, date = {2008-06-19}, ee = {http://doi.acm.org/10.1145/1277741.1277872}, isbn = {978-1-59593-597-7}, keywords = {dblp } } @inproceedings{CastilloDGMS07, title = {Know your neighbors: web spam detection using the web topology.}, author = {Carlos Castillo and Debora Donato and Aristides Gionis and Vanessa Murdock and Fabrizio Silvestri}, booktitle = {SIGIR}, crossref = {conf/sigir/2007}, editor = {Wessel Kraaij and Arjen P. de Vries and Charles L. A. Clarke and Norbert Fuhr and Noriko Kando}, pages = {423-430}, publisher = {ACM}, url = {http://www.dcc.uchile.cl/~ccastill/papers/cdgms_2006_know_your_neighbors.pdf}, year = {2007}, biburl = {http://www.bibsonomy.org/bibtex/2843605d513b807944ef11c076c2d0e95/michi}, abstract = {Web spam can significantly deteriorate the quality of searchengine results. Thus there is a large incentive for commercialsearch engines to detect spam pages efficiently and accurately.In this paper we present a spam detection systemthat uses the topology of the Web graph by exploiting thelink dependencies among the Web pages, and the contentof the pages themselves. We find that linked hosts tend tobelong to the same class: either both are spam or both arenon-spam. We demonstrate three methods of incorporatingthe Web graph topology into the predictions obtained byour base classifier: (i) clustering the host graph, and assigningthe label of all hosts in the cluster by majority vote, (ii)propagating the predicted labels to neighboring hosts, and(iii) using the predicted labels of neighboring hosts as newfeatures and retraining the classifier. The result is an accuratesystem for detecting Web spam that can be applied inpractice to large-scale Web data.Categories and Subject Descriptors: H.4.m [InformationSystems Applications]: MiscellaneousGeneral Terms: Algorithms, Measurement.Keywords: Link spam, Content spam, Web spam}, ee = {http://doi.acm.org/10.1145/1277741.1277814}, isbn = {978-1-59593-597-7}, date = {2007-08-24}, keywords = {detection neighbors spam spamdetection web } } @incollection{citeulike:2043552, title = {Models in Information Retrieval}, author = {Norbert Fuhr}, journal = {Lectures on Information Retrieval: Third European Summer-School, ESSIR 2000, Varenna, Italy, September 11-15, 2000. Revised Lectures}, pages = {21+}, url = {http://www.springerlink.com/content/02bmlrvcaax428pn }, year = {2001}, biburl = {http://www.bibsonomy.org/bibtex/2f02be33040c4366d4911144b57f12840/pprett}, abstract = {Retrieval models form the theoretical basis for computing the answer to a query. They differ not only in the syntax and expressiveness of the query language, but also in the representation of the documents. Following Rijsbergen's approach of regarding IR as uncertain inference, we can distinguish models according to the expressiveness of the underlying logic and the way uncertainty is handled. Classical retrieval models are based on propositional logic. In the vector space model, documents and queries are represented as vectors in a vector space spanned by the index terms, and uncertainty is modelled by considering geometric similarity. Probabilistic models make assumptions about the distribution of terms in relevant and nonrelevant documents in order to estimate the probability of relevance of a document for a query. Language models compute the probability that the query is generated from a document. All these models can be interpreted within a framework that is based on a probabilistic concept space. For IR applications dealing not only with texts, but also with multimedia or factual data, propositional logic is not sufficient. Therefore, advanced IR models use restricted forms of predicate logic as basis. Terminological/description logics are rooted in semantic networks and terminological languages like e.g. KL-ONE. Datalog uses function-free horn clauses. Probabilistic versions of both approaches are able to cope with the intrinsic uncertainty of IR.}, posted-at = {2007-12-02 12:20:18}, priority = {4}, citeulike-article-id = {2043552}, keywords = {information, models, retrieval, survey } } @article{citeulike:1734785, title = {A probabilistic learning approach for document indexing}, address = {New York, NY, USA}, author = {Norbert Fuhr and Chris Buckley}, journal = {ACM Trans. Inf. Syst.}, month = {July}, number = {3}, pages = {223--248}, publisher = {ACM Press}, url = {http://portal.acm.org/citation.cfm?id=125189}, volume = {9}, year = {1991}, biburl = {http://www.bibsonomy.org/bibtex/290e48260b09972588716352214f61594/pprett}, issn = {1046-8188}, posted-at = {2008-05-26 10:48:52}, citeulike-article-id = {1734785}, priority = {2}, doi = {10.1145/125187.125189}, keywords = {connectionist, ir, learning, probabilistic } } @book{seghezzi1992, title = {Top management and quality : [papers presented at the 5th European Seminar on Top-Management and Quality ... held under the theme "Total Quality Management" on September 9 and 19, 1991 in St. Gallen, Switzerland]}, address = {Hanser}, annote = {VII, 170 S}, author = {{Hans Dieter} Seghezzi and {Horst} Fuhr}, howpublished = {Munich [u.a.]}, url = {http://gso.gbv.de/DB=2.1/CMD?ACT=SRCHA&SRT=YOP&IKT=1016&TRM=ppn+117957763&sourceid=fbw_bibsonomy}, year = {1992}, biburl = {http://www.bibsonomy.org/bibtex/2c628a476e893691b048e32924a8922eb/fbw}, description = {imported}, isbn = {3-446-16595-9}, keywords = {imported } } @book{jungwirth1994, title = {Qualitätsmanagement im Bauwesen}, address = {VDI-Verl.}, annote = {XIV, 189 S}, author = {{Dieter} Jungwirth and {Horst} Fuhr}, howpublished = {Düsseldorf}, url = {http://gso.gbv.de/DB=2.1/CMD?ACT=SRCHA&SRT=YOP&IKT=1016&TRM=ppn+172646308&sourceid=fbw_bibsonomy}, year = {1994}, biburl = {http://www.bibsonomy.org/bibtex/2108453e17665f17c3256388092b8be57/fbw}, description = {imported}, isbn = {3-18-401356-1}, keywords = {imported } }