scholarly journals Mining Concept Sequences from Large-Scale Search Logs for Context-Aware Query Suggestion

2011 ◽  
Vol 3 (1) ◽  
pp. 1-40 ◽  
Author(s):  
Zhen Liao ◽  
Daxin Jiang ◽  
Enhong Chen ◽  
Jian Pei ◽  
Huanhuan Cao ◽  
...  
Author(s):  
Jizhou Huang ◽  
Wei Zhang ◽  
Yaming Sun ◽  
Haifeng Wang ◽  
Ting Liu

Entity recommendation, providing search users with an improved experience by assisting them in finding related entities for a given query, has become an indispensable feature of today's Web search engine. Existing studies typically only consider the query issued at the current time step while ignoring the in-session preceding queries. Thus, they typically fail to handle the ambiguous queries such as "apple" because the model could not understand which apple (company or fruit) is talked about. In this work, we believe that the in-session contexts convey valuable evidences that could facilitate the semantic modeling of queries, and take that into consideration for entity recommendation. Furthermore, in order to better model the semantics of queries, we learn the model in a multi-task learning setting where the query representation is shared across entity recommendation and context-aware ranking. We evaluate our approach using large-scale, real-world search logs of a widely used commercial Web search engine. The experimental results show that incorporating context information significantly improves entity recommendation, and learning the model in a multi-task learning setting could bring further improvements.


Author(s):  
Hongli Wang ◽  
Bin Guo ◽  
Jiaqi Liu ◽  
Sicong Liu ◽  
Yungang Wu ◽  
...  

Deep Neural Networks (DNNs) have made massive progress in many fields and deploying DNNs on end devices has become an emerging trend to make intelligence closer to users. However, it is challenging to deploy large-scale and computation-intensive DNNs on resource-constrained end devices due to their small size and lightweight. To this end, model partition, which aims to partition DNNs into multiple parts to realize the collaborative computing of multiple devices, has received extensive research attention. To find the optimal partition, most existing approaches need to run from scratch under given resource constraints. However, they ignore that resources of devices (e.g., storage, battery power), and performance requirements (e.g., inference latency), are often continuously changing, making the optimal partition solution change constantly during processing. Therefore, it is very important to reduce the tuning latency of model partition to realize the real-time adaption under the changing processing context. To address these problems, we propose the Context-aware Adaptive Surgery (CAS) framework to actively perceive the changing processing context, and adaptively find the appropriate partition solution in real-time. Specifically, we construct the partition state graph to comprehensively model different partition solutions of DNNs by import context resources. Then "the neighbor effect" is proposed, which provides the heuristic rule for the search process. When the processing context changes, CAS adopts the runtime search algorithm, Graph-based Adaptive DNN Surgery (GADS), to quickly find the appropriate partition that satisfies resource constraints under the guidance of the neighbor effect. The experimental results show that CAS realizes adaptively rapid tuning of the model partition solutions in 10ms scale even for large DNNs (2.25x to 221.7x search time improvement than the state-of-the-art researches), and the total inference latency still keeps the same level with baselines.


Author(s):  
Dongyeop Kang ◽  
Daxin Jiang ◽  
Jian Pei ◽  
Zhen Liao ◽  
Xiaohui Sun ◽  
...  
Keyword(s):  

2018 ◽  
Vol 91 ◽  
pp. 78-88 ◽  
Author(s):  
Hongtao Wang ◽  
Hongmei Wang ◽  
Feng Yi ◽  
Hui Wen ◽  
Gang Li ◽  
...  
Keyword(s):  

2022 ◽  
Vol 16 (1) ◽  
pp. 1-34
Author(s):  
Yiji Zhao ◽  
Youfang Lin ◽  
Zhihao Wu ◽  
Yang Wang ◽  
Haomin Wen

Dynamic networks are widely used in the social, physical, and biological sciences as a concise mathematical representation of the evolving interactions in dynamic complex systems. Measuring distances between network snapshots is important for analyzing and understanding evolution processes of dynamic systems. To the best of our knowledge, however, existing network distance measures are designed for static networks. Therefore, when measuring the distance between any two snapshots in dynamic networks, valuable context structure information existing in other snapshots is ignored. To guide the construction of context-aware distance measures, we propose a context-aware distance paradigm, which introduces context information to enrich the connotation of the general definition of network distance measures. A Context-aware Spectral Distance (CSD) is then given as an instance of the paradigm by constructing a context-aware spectral representation to replace the core component of traditional Spectral Distance (SD). In a node-aligned dynamic network, the context effectively helps CSD gain mainly advantages over SD as follows: (1) CSD is not affected by isospectral problems; (2) CSD satisfies all the requirements of a metric, while SD cannot; and (3) CSD is computationally efficient. In order to process large-scale networks, we develop a kCSD that computes top- k eigenvalues to further reduce the computational complexity of CSD. Although kCSD is a pseudo-metric, it retains most of the advantages of CSD. Experimental results in two practical applications, i.e., event detection and network clustering in dynamic networks, show that our context-aware spectral distance performs better than traditional spectral distance in terms of accuracy, stability, and computational efficiency. In addition, context-aware spectral distance outperforms other baseline methods.


2011 ◽  
Author(s):  
Young-Sik Jeong ◽  
Eun-Ha Song ◽  
Gab-Byung Chae ◽  
Min Hong ◽  
Doo-Soon Park

Sign in / Sign up

Export Citation Format

Share Document