Sciweavers

1756 search results - page 66 / 352
» Mining Query Logs
Sort
View
CCCG
2008
13 years 11 months ago
Smallest enclosing circle centered on a query line segment
Given a set of n points P = {p1, p2, . . . , pn} in the plane, we show how to preprocess P such that for any query line segment L we can report in O(log n) time the smallest enclo...
Prosenjit Bose, Stefan Langerman, Sasanka Roy
WWW
2008
ACM
14 years 10 months ago
Identifying regional sensitive queries in web search
In Web search ranking, the expected results for some queries could vary greatly depending upon location of the user. We name such queries regional sensitive queries. Identifying r...
Srinivas Vadrevu, Ya Zhang, Belle L. Tseng, Gordon...
SIGMOD
2010
ACM
277views Database» more  SIGMOD 2010»
14 years 2 months ago
A comparison of join algorithms for log processing in MaPreduce
The MapReduce framework is increasingly being used to analyze large volumes of data. One important type of data analysis done with MapReduce is log processing, in which a click-st...
Spyros Blanas, Jignesh M. Patel, Vuk Ercegovac, Ju...
SDM
2009
SIAM
223views Data Mining» more  SDM 2009»
14 years 7 months ago
Context Aware Trace Clustering: Towards Improving Process Mining Results.
Process Mining refers to the extraction of process models from event logs. Real-life processes tend to be less structured and more flexible. Traditional process mining algorithms...
R. P. Jagadeesh Chandra Bose, Wil M. P. van der Aa...
ICDM
2006
IEEE
154views Data Mining» more  ICDM 2006»
14 years 4 months ago
Mining and Predicting Duplication over Peer-to-Peer Query Streams
Many previous works of data mining user queries in Peer-to-Peer systems focused their attention on the distribution of query contents. However, few has been done towards a better ...
Shicong Meng, Yifeng Shao, Cong Shi, Dingyi Han, Y...