A Bipartite Graph Based Competitiveness Degrees Analysis with Query Logs on Search Engine
Dandan Qiao, Qiang Wei, Jin Zhang, Guoqing Chen
Available Online June 2015.
- https://doi.org/10.2991/ifsa-eusflat-15.2015.91How to use a DOI?
- Competitiveness degree, query log, bipar-tite graph model.
- Competitive intelligence analysis based on user gener-ated contents (UGCs) shows advantages on possessing the benefit of the wisdom of crowds, evading cognitive biases and timely updating. This paper investigates and constructs a bipartite graph model by extracting joint co-occurrence of competitors from query logs, i.e., an important type of UGCs. The model represents the in-herent competitiveness among competitors, based on which their mutual competitiveness degrees can be measured. Moreover, the BGComp algorithm is de-signed as well. Finally, an analysis on forecasting au-tomobiles’ sales demonstrates the better forecasting power of the regression models integrating the competi-tiveness degrees than the benchmark model.
- Open Access
- This is an open access article distributed under the CC BY-NC license.
Cite this article
TY - CONF AU - Dandan Qiao AU - Qiang Wei AU - Jin Zhang AU - Guoqing Chen PY - 2015/06 DA - 2015/06 TI - A Bipartite Graph Based Competitiveness Degrees Analysis with Query Logs on Search Engine BT - Proceedings of the 2015 Conference of the International Fuzzy Systems Association and the European Society for Fuzzy Logic and Technology PB - Atlantis Press SP - 638 EP - 643 SN - 1951-6851 UR - https://doi.org/10.2991/ifsa-eusflat-15.2015.91 DO - https://doi.org/10.2991/ifsa-eusflat-15.2015.91 ID - Qiao2015/06 ER -