Local Feedback in Full-Text Retrieval Systems
Journal of the ACM (JACM)
Improving the effectiveness of information retrieval with local context analysis
ACM Transactions on Information Systems (TOIS)
Agglomerative clustering of a search engine query log
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Clustering user queries of a search engine
Proceedings of the 10th international conference on World Wide Web
Probabilistic query expansion using query logs
Proceedings of the 11th international conference on World Wide Web
Modern Information Retrieval
Optimizing search engines using clickthrough data
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Identifying similarities, periodicities and bursts for online search queries
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Hourly analysis of a very large topically categorized web query log
Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval
Optimizing web search using web click-through data
Proceedings of the thirteenth ACM international conference on Information and knowledge management
Semantic similarity between search engine queries using temporal correlation
WWW '05 Proceedings of the 14th international conference on World Wide Web
CubeSVD: a novel approach to personalized Web search
WWW '05 Proceedings of the 14th international conference on World Wide Web
Analysis of topic dynamics in web search
WWW '05 Special interest tracks and posters of the 14th international conference on World Wide Web
Web resource geographic location classification and detection
WWW '05 Special interest tracks and posters of the 14th international conference on World Wide Web
Accurately interpreting clickthrough data as implicit feedback
Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval
Query chains: learning to rank from implicit feedback
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Event detection from evolution of click-through data
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Scalable relevance feedback using click-through data for web image retrieval
MULTIMEDIA '06 Proceedings of the 14th annual ACM international conference on Multimedia
Proceedings of the 17th ACM conference on Information and knowledge management
Event detection with common user interests
Proceedings of the 10th ACM workshop on Web information and data management
Enabling Social Navigation on the Web
WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
An algorithm for analyzing personalized online commercial intention
Proceedings of the 2nd International Workshop on Data Mining and Audience Intelligence for Advertising
Consistent phrase relevance measures
Proceedings of the 2nd International Workshop on Data Mining and Audience Intelligence for Advertising
Efficient anomaly monitoring over moving object trajectory streams
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
A study of information retrieval on accumulative social descriptions using the generation features
Proceedings of the 18th ACM conference on Information and knowledge management
A unified relevance feedback framework for web image retrieval
IEEE Transactions on Image Processing
Optimal distance bounds for fast search on compressed time-series query logs
ACM Transactions on the Web (TWEB)
Personalized search on the world wide web
The adaptive web
Mining Query Logs: Turning Search Usage Data into Knowledge
Foundations and Trends in Information Retrieval
Detecting periodic changes in search intentions in a search engine
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
A word at a time: computing word relatedness using temporal semantic analysis
Proceedings of the 20th international conference on World wide web
On nonmetric similarity search problems in complex domains
ACM Computing Surveys (CSUR)
Proceedings of the 12th ACM/IEEE-CS joint conference on Digital Libraries
Learning-based time-sensitive re-ranking for web search
SIGIR '12 Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval
Toward whole-session relevance: exploring intrinsic diversity in web search
Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval
Identify the User's Information Need Using the Current Search Context
International Journal of Enterprise Information Systems
Investigating query bursts in a web search engine
Web Intelligence and Agent Systems
Hi-index | 0.00 |
It has become a promising direction to measure similarity of Web search queries by mining the increasing amount of click-through data logged by Web search engines, which record the interactions between users and the search engines. Most existing approaches employ the click-through data for similarity measure of queries with little consideration of the temporal factor, while the click-through data is often dynamic and contains rich temporal information. In this paper we present a new framework of time-dependent query semantic similarity model on exploiting the temporal characteristics of historical click-through data. The intuition is that more accurate semantic similarity values between queries can be obtained by taking into account the timestamps of the log data. With a set of user-defined calendar schema and calendar patterns, our time-dependent query similarity model is constructed using the marginalized kernel technique, which can exploit both explicit similarity and implicit semantics from the click-through data effectively. Experimental results on a large set of click-through data acquired from a commercial search engine show that our time-dependent query similarity model is more accurate than the existing approaches. Moreover, we observe that our time-dependent query similarity model can, to some extent, reflect real-world semantics such as real-world events that are happening over time.