2016 IEEE/WIC/ACM International Conference on Web Intelligence (WI) 2016
DOI: 10.1109/wi.2016.0040
|View full text |Cite
|
Sign up to set email alerts
|

Query Suggestion for Struggling Search by Struggling Flow Graph

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2017
2017
2018
2018

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 22 publications
0
2
0
Order By: Relevance
“…Much research has explored the area of query recommendation based on query logs [4][5][6]. Chen et al [4] proposed a query suggestion method by constructing struggling flow graph to identify the struggle phrases and mine effective representation based on query log. Zahera et al [6] proposed a method based on clustering processes in which groups of semantically similar queries are detected.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Much research has explored the area of query recommendation based on query logs [4][5][6]. Chen et al [4] proposed a query suggestion method by constructing struggling flow graph to identify the struggle phrases and mine effective representation based on query log. Zahera et al [6] proposed a method based on clustering processes in which groups of semantically similar queries are detected.…”
Section: Related Workmentioning
confidence: 99%
“…(3) RW UQ [15]: This is a method calculating the bidirectional transition probability-based query-URL graph and making a strength metric of the query-URL edges. (4) CQM [6]:This is a method based on clustering processes in which groups of semantically similar queries are detected. (5) QRSR: Our method considers query information and URL information.…”
Section: Evaluation Of Efficiencymentioning
confidence: 99%