Search For:

Displaying 1-4 out of 4 total
User-Centric Organization of Search Results
Found in: IEEE Internet Computing
By Byron J. Gao,David Buttler,David C. Anastasiu,Shuaiqiang Wang,Peng Zhang,Joey Jan
Issue Date:May 2013
pp. 52-59
The authors investigated the use of microblogs—or weibos—and related censorship practices using 111 million microblogs collected between 1 January and 30 June 2012. Using a matched case-control study design helped researchers determin...
L2AP: Fast cosine similarity search with prefix L-2 norm bounds
Found in: 2014 IEEE 30th International Conference on Data Engineering (ICDE)
By David C. Anastasiu,George Karypis
Issue Date:March 2014
pp. 784-795
The All-Pairs similarity search, or self-similarity join problem, finds all pairs of vectors in a high dimensional sparse dataset with a similarity value higher than a given threshold. The problem has been classically solved using a dynamically built inver...
A framework for personalized and collaborative clustering of search results
Found in: Proceedings of the 20th ACM international conference on Information and knowledge management (CIKM '11)
By Byron J. Gao, David Buttler, David C. Anastasiu
Issue Date:October 2011
pp. 573-582
How to organize and present search results plays a critical role in the utility of search engines. Due to the unprecedented scale of the Web and diversity of search results, the common strategy of ranked lists has become increasingly inadequate, and cluste...
The gardener's problem for web information monitoring
Found in: Proceeding of the 18th ACM conference on Information and knowledge management (CIKM '09)
By Byron J. Gao, David C. Anastasiu, Mingji Xia, Walter Cai
Issue Date:November 2009
pp. 1525-1528
We introduce and theoretically study the Gardener's problem that well models many web information monitoring scenarios, where numerous dynamically changing web sources are monitored and local information needs to be periodically updated under communication...