-
1
-
-
1542317693
-
Using terminological feedback for web search refinement: A log-based study
-
P. Anick. Using terminological feedback for web search refinement: a log-based study. In SIGIR '03, 2003.
-
(2003)
SIGIR '03
-
-
Anick, P.1
-
3
-
-
36849087956
-
Extracting semantic relations from query logs
-
New York, NY, USA, ACM
-
R. Baeza-Yates and A. Tiberi. Extracting semantic relations from query logs. In KDD'07: 13th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 76-85, New York, NY, USA, 2007. ACM.
-
(2007)
KDD'07: 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
, pp. 76-85
-
-
Baeza-Yates, R.1
Tiberi, A.2
-
4
-
-
74549178494
-
Automatic generation of topic pages using query-based aspect models
-
New York, NY, USA, ACM
-
N. Balasubramanian and S. Cucerzan. Automatic generation of topic pages using query-based aspect models. In CIKM'09: 18th ACM conference on Information and knowledge management, pages 2049-2052, New York, NY, USA, 2009. ACM.
-
(2009)
CIKM'09: 18th ACM Conference on Information and Knowledge Management
, pp. 2049-2052
-
-
Balasubramanian, N.1
Cucerzan, S.2
-
5
-
-
18744406314
-
The origin of bursts and heavy tails in human dynamics
-
A. L. Barabasi. The origin of bursts and heavy tails in human dynamics. Nature, 435:207, 2005.
-
(2005)
Nature
, vol.435
, pp. 207
-
-
Barabasi, A.L.1
-
6
-
-
0034593050
-
Agglomerative clustering of a search engine query log
-
New York, NY, USA, ACM
-
D. Beeferman and A. Berger. Agglomerative clustering of a search engine query log. In KDD'00: 6th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 407-416, New York, NY, USA, 2000. ACM.
-
(2000)
KDD'00: 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
, pp. 407-416
-
-
Beeferman, D.1
Berger, A.2
-
7
-
-
34247869672
-
Automatic classification of web queries using very large unlabeled query logs
-
April
-
S. M. Beitzel, E. C. Jensen, D. D. Lewis, A. Chowdhury, and O. Frieder. Automatic classification of web queries using very large unlabeled query logs. ACM Transactions on Information Systems, 25, April 2007.
-
(2007)
ACM Transactions on Information Systems
, vol.25
-
-
Beitzel, S.M.1
Jensen, E.C.2
Lewis, D.D.3
Chowdhury, A.4
Frieder, O.5
-
8
-
-
70349237629
-
The query-flow graph: Model and applications
-
New York, NY, USA, ACM
-
P. Boldi, F. Bonchi, C. Castillo, D. Donato, A. Gionis, and S. Vigna. The query-flow graph: model and applications. In CIKM'08: Proceeding of the 17th ACM conference on Information and knowledge management, pages 609-618, New York, NY, USA, 2008. ACM.
-
(2008)
CIKM'08: Proceeding of the 17th ACM Conference on Information and Knowledge Management
, pp. 609-618
-
-
Boldi, P.1
Bonchi, F.2
Castillo, C.3
Donato, D.4
Gionis, A.5
Vigna, S.6
-
9
-
-
77956025821
-
Query similarity by projecting the query-flow graph
-
ACM
-
I. Bordino, C. Castillo, D. Donato, and A. Gionis. Query similarity by projecting the query-flow graph. In SIGIR'10, pages 515-522. ACM, 2010.
-
(2010)
SIGIR'10
, pp. 515-522
-
-
Bordino, I.1
Castillo, C.2
Donato, D.3
Gionis, A.4
-
10
-
-
77955103497
-
On Finding Graph Clusterings with Maximum Modularity
-
Lecture Notes in Computer Science
-
U. Brandes, D. Delling, M. Höfer, M. Gaertler, R. Görke, Z. Nikoloski, and D. Wagner. On Finding Graph Clusterings with Maximum Modularity. In WG'07: Proceedings of the 33rd International Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, 2007.
-
(2007)
WG'07: Proceedings of the 33rd International Workshop on Graph-Theoretic Concepts in Computer Science
-
-
Brandes, U.1
Delling, D.2
Höfer, M.3
Gaertler, M.4
Görke, R.5
Nikoloski, Z.6
Wagner, D.7
-
11
-
-
65449160200
-
Context-aware query suggestion by mining click-through and session data
-
New York, NY, USA, ACM
-
H. Cao, D. Jiang, J. Pei, Q. He, Z. Liao, E. Chen, and H. Li. Context-aware query suggestion by mining click-through and session data. In KDD'08: 14th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 875-883, New York, NY, USA, 2008. ACM.
-
(2008)
KDD'08: 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
, pp. 875-883
-
-
Cao, H.1
Jiang, D.2
Pei, J.3
He, Q.4
Liao, Z.5
Chen, E.6
Li, H.7
-
12
-
-
18744369336
-
A practical web-based approach to generating topic hierarchy for text segments
-
New York, NY, USA, ACM
-
S.-L. Chuang and L.-F. Chien. A practical web-based approach to generating topic hierarchy for text segments. In CIKM'04: 13th ACM international conference on Information and knowledge management, pages 127-136, New York, NY, USA, 2004. ACM.
-
(2004)
CIKM'04: 13th ACM International Conference on Information and Knowledge Management
, pp. 127-136
-
-
Chuang, S.-L.1
Chien, L.-F.2
-
13
-
-
77954627494
-
Do you want to take notes?: Identifying research missions in Yahoo! search pad
-
New York, NY, USA, ACM
-
D. Donato, F. Bonchi, T. Chi, and Y. Maarek. Do you want to take notes?: identifying research missions in Yahoo! search pad. In WWW'10: 19th international conference on World wide web, pages 321-330, New York, NY, USA, 2010. ACM.
-
(2010)
WWW'10: 19th International Conference on World Wide Web
, pp. 321-330
-
-
Donato, D.1
Bonchi, F.2
Chi, T.3
Maarek, Y.4
-
14
-
-
0030709534
-
Automatic feedback using past queries: Social searching?
-
L. Fitzpatrick and M. Dent. Automatic feedback using past queries: social searching? In SIGIR '97, 1997.
-
(1997)
SIGIR '97
-
-
Fitzpatrick, L.1
Dent, M.2
-
15
-
-
74049087026
-
Community detection in graphs
-
S. Fortunato. Community detection in graphs. Physics Reports, 486(3-5):75-174, 2010.
-
(2010)
Physics Reports
, vol.486
, Issue.3-5
, pp. 75-174
-
-
Fortunato, S.1
-
17
-
-
34547643920
-
Exploiting asymmetry in hierarchical topic extraction
-
New York, NY, USA, ACM
-
S. Gollapudi and R. Panigrahy. Exploiting asymmetry in hierarchical topic extraction. In CIKM'06: 15th ACM international conference on Information and knowledge management, pages 475-482, New York, NY, USA, 2006. ACM.
-
(2006)
CIKM'06: 15th ACM International Conference on Information and Knowledge Management
, pp. 475-482
-
-
Gollapudi, S.1
Panigrahy, R.2
-
18
-
-
41649116207
-
Regularized query classification using search click information
-
July
-
X. He and P. Jhala. Regularized query classification using search click information. Pattern Recognition, 41:2283-2288, July 2008.
-
(2008)
Pattern Recognition
, vol.41
, pp. 2283-2288
-
-
He, X.1
Jhala, P.2
-
19
-
-
85026972772
-
Probabilistic latent semantic indexing
-
T. Hofmann. Probabilistic latent semantic indexing. In SIGIR'99, pages 50-57, 1999.
-
(1999)
SIGIR'99
, pp. 50-57
-
-
Hofmann, T.1
-
20
-
-
67650044839
-
Beyond the session timeout: Automatic hierarchical segmentation of search topics in query logs
-
New York, NY, USA, ACM
-
R. Jones and K. L. Klinkner. Beyond the session timeout: automatic hierarchical segmentation of search topics in query logs. In CIKM'08: Proceeding of the 17th ACM conference on Information and knowledge management, pages 699-708, New York, NY, USA, 2008. ACM.
-
(2008)
CIKM'08: Proceeding of the 17th ACM Conference on Information and Knowledge Management
, pp. 699-708
-
-
Jones, R.1
Klinkner, K.L.2
-
21
-
-
67650044839
-
Beyond the session timeout: Automatic hierarchical segmentation of search topics in query logs
-
New York, NY, USA, ACM
-
R. Jones and K. L. Klinkner. Beyond the session timeout: automatic hierarchical segmentation of search topics in query logs. In CIKM '08: 17th ACM conference on Information and knowledge mining, pages 699-708, New York, NY, USA, 2008. ACM.
-
(2008)
CIKM '08: 17th ACM Conference on Information and Knowledge Mining
, pp. 699-708
-
-
Jones, R.1
Klinkner, K.L.2
-
22
-
-
55849088356
-
Benchmark graphs for testing community detection algorithms
-
A. Lancichinetti, S. Fortunato, and F. Radicchi. Benchmark graphs for testing community detection algorithms. Physical Review E (Statistical, Nonlinear, and Soft Matter Physics), 78(4), 2008.
-
(2008)
Physical Review E (Statistical, Nonlinear, and Soft Matter Physics)
, vol.78
, Issue.4
-
-
Lancichinetti, A.1
Fortunato, S.2
Radicchi, F.3
-
23
-
-
79955707583
-
Finding statistically significant communities in networks
-
A. Lancichinetti, F. Radicchi, J. J. Ramasco, and S. Fortunato. Finding statistically significant communities in networks. PLoS ONE, 6(4), 04 2011.
-
(2011)
PLoS ONE
, vol.6
, Issue.4
, pp. 04
-
-
Lancichinetti, A.1
Radicchi, F.2
Ramasco, J.J.3
Fortunato, S.4
-
24
-
-
52949106331
-
Statistical properties of community structure in large social and information networks
-
New York, NY, USA, ACM
-
J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney. Statistical properties of community structure in large social and information networks. In WWW'08: Proceedings of the 17th international conference on World Wide Web, pages 695-704, New York, NY, USA, 2008. ACM.
-
(2008)
WWW'08: Proceedings of the 17th International Conference on World Wide Web
, pp. 695-704
-
-
Leskovec, J.1
Lang, K.J.2
Dasgupta, A.3
Mahoney, M.W.4
-
25
-
-
84990671447
-
A critical point for random graphs with a given degree sequence
-
March
-
M. Molloy and B. Reed. A critical point for random graphs with a given degree sequence. Random Structures & Algorithms, 6:161-179, March 1995.
-
(1995)
Random Structures & Algorithms
, vol.6
, pp. 161-179
-
-
Molloy, M.1
Reed, B.2
-
26
-
-
37649028224
-
Finding and evaluating community structure in networks
-
M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. Physical Review E, 69, 2004.
-
(2004)
Physical Review E
, vol.69
-
-
Newman, M.E.J.1
Girvan, M.2
-
27
-
-
32344431861
-
Query chains: Learning to rank from implicit feedback
-
New York, NY, USA, ACM
-
F. Radlinski and T. Joachims. Query chains: learning to rank from implicit feedback. In KDD'05: 11th ACM SIGKDD international conference on Knowledge discovery in data mining, pages 239-248, New York, NY, USA, 2005. ACM.
-
(2005)
KDD'05: 11th ACM SIGKDD International Conference on Knowledge Discovery in Data Mining
, pp. 239-248
-
-
Radlinski, F.1
Joachims, T.2
-
28
-
-
0029205263
-
On the reuse of past optimal queries
-
V. V. Raghavan and H. Sever. On the reuse of past optimal queries. In SIGIR '95, 1995.
-
(1995)
SIGIR '95
-
-
Raghavan, V.V.1
Sever, H.2
-
29
-
-
0003653039
-
-
McGraw-Hill, Inc., New York, NY, USA
-
G. Salton and M. J. McGill. Introduction to Modern Information Retrieval. McGraw-Hill, Inc., New York, NY, USA, 1986.
-
(1986)
Introduction to Modern Information Retrieval
-
-
Salton, G.1
McGill, M.J.2
-
30
-
-
70350237030
-
Efficient clustering of web-derived data sets
-
Berlin, Heidelberg, Springer-Verlag
-
L. Sarmento, A. Kehlenbeck, E. Oliveira, and L. Ungar. Efficient clustering of web-derived data sets. In MLDM '09: 6th International Conference on Machine Learning and Data Mining in Pattern Recognition, pages 398-412, Berlin, Heidelberg, 2009. Springer-Verlag.
-
(2009)
MLDM '09: 6th International Conference on Machine Learning and Data Mining in Pattern Recognition
, pp. 398-412
-
-
Sarmento, L.1
Kehlenbeck, A.2
Oliveira, E.3
Ungar, L.4
-
31
-
-
80053427148
-
Bridging topic modeling and personalized search
-
Stroudsburg, PA, USA, Association for Computational Linguistics
-
W. Song, Y. Zhang, T. Liu, and S. Li. Bridging topic modeling and personalized search. In COLING'10: 23rd International Conference on Computational Linguistics: Posters, pages 1167-1175, Stroudsburg, PA, USA, 2010. Association for Computational Linguistics.
-
(2010)
COLING'10: 23rd International Conference on Computational Linguistics: Posters
, pp. 1167-1175
-
-
Song, W.1
Zhang, Y.2
Liu, T.3
Li, S.4
-
32
-
-
70449116112
-
Intent based clustering of search engine query log
-
Piscataway, NJ, USA, IEEE
-
A. Veilumuthu and P. Ramachandran. Intent based clustering of search engine query log. In CASE'09: 5th IEEE international conference on Automation science and engineering, pages 647-652, Piscataway, NJ, USA, 2009. IEEE.
-
(2009)
CASE'09: 5th IEEE International Conference on Automation Science and Engineering
, pp. 647-652
-
-
Veilumuthu, A.1
Ramachandran, P.2
-
33
-
-
0038546532
-
Query clustering using user logs
-
DOI 10.1145/503104.503108
-
J.-R. Wen, J.-Y. Nie, and Z. Hong-Jiang. Query clustering using user logs. ACM Transactions on Information Systems, 20:59-81, January 2002. (Pubitemid 44642307)
-
(2002)
ACM Transactions on Information Systems
, vol.20
, Issue.1
, pp. 59-81
-
-
Wen, J.-R.1
Nie, J.-Y.2
Zhang, H.-J.3
-
35
-
-
74549138522
-
Stochastic gradient boosted distributed decision trees
-
New York, NY, USA, ACM
-
J. Ye, J.-H. Chow, J. Chen, and Z. Zheng. Stochastic gradient boosted distributed decision trees. In CIKM'09: 18th ACM conference on Information and knowledge management, pages 2061-2064, New York, NY, USA, 2009. ACM.
-
(2009)
CIKM'09: 18th ACM Conference on Information and Knowledge Management
, pp. 2061-2064
-
-
Ye, J.1
Chow, J.-H.2
Chen, J.3
Zheng, Z.4
-
36
-
-
72249122084
-
Query clustering using click-through graph
-
New York, NY, USA, ACM
-
J. Yi and F. Maghoul. Query clustering using click-through graph. In WWW'09: 18th international conference on World wide web, pages 1055-1056, New York, NY, USA, 2009. ACM.
-
(2009)
WWW'09: 18th International Conference on World Wide Web
, pp. 1055-1056
-
-
Yi, J.1
Maghoul, F.2
-
37
-
-
8644273327
-
Learning to cluster web search results
-
New York, NY, USA, ACM
-
H.-J. Zeng, Q.-C. He, Z. Chen, W.-Y. Ma, and J. Ma. Learning to cluster web search results. In SIGIR'04: 27th annual international ACM SIGIR conference on Research and development in information retrieval, pages 210-217, New York, NY, USA, 2004. ACM.
-
(2004)
SIGIR'04: 27th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval
, pp. 210-217
-
-
Zeng, H.-J.1
He, Q.-C.2
Chen, Z.3
Ma, W.-Y.4
Ma, J.5
|