A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is
We show that by reducing the problem to a recently solved tree-indexing scenario, data with correlated facets can be efficiently indexed and retrieved. ... Our second extension shows how one can efficiently extend a faceted search engine to support correlated facets -a more complex information model in which the values associated with a document across multiple ... ACKNOWLEDGEMENTS We thank fellow IBMers John Bosma, Andrew Chasin, Cliff Leung, Michael McCandeles, John McPherson and Mike Moran for many useful discussions over the course of this work. ...doi:10.1145/1341531.1341539 dblp:conf/wsdm/Ben-YitzhakGHLNOSSSY08 fatcat:l2q2szegcnd25p2rhkiwvkx6ca
Most previous algorithms proposed to address this problem focus on minimizing the number of misranked document pairs in the training set. ... This method performs comparably or better than two state-of-the-art rank learning algorithms, and also provides significant training time improvements over those methods, showing over a 45fold reduction ... The definitive version was published in the Proceedings of WSDM2008, February   2008 , Palo Alto, California, USA. ...doi:10.1145/1341531.1341542 dblp:conf/wsdm/ElsasCC08 fatcat:jz6fzvtbqfezffbcja3e6luhdu
The data sets are collected from social web sources and more specifically from twitter. The programming part of this study is developed using python. ... The main avocation is the detection of the set of the most frequent used words inside the data sets that are used in the analysis. ... Palo Alto, California, USA : WSDM’08, February 11-12, 2008. 17. Philip Beineke, Trevor Hastie, Christopher Manning, Shivakumar Vaithyanathan. An exploration of sentiment summarization. ...doi:10.26262/heal.auth.ir.129201 fatcat:p5lxzmpcsfaq3i2rze7dueevpe