{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:12:57Z","timestamp":1750219977637,"version":"3.41.0"},"reference-count":43,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2023,6,13]],"date-time":"2023-06-13T00:00:00Z","timestamp":1686614400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2023,6,13]]},"abstract":"<jats:p>Competitor data constitutes information significantly valuable for many business applications. Meltwater provides users with access to a large Company Information System (CIS), Owler, which contains competitor pairs and other useful information about companies. Meltwater has been seeking a practical solution to discover more competitor pairs in Owler. The first attempt, a fully-manual workflow (called MW_Manual) for finding more competitor pairs in Owler consisted of two manual steps: a filtering step that excludes obvious non-competitor company pairs, and a further inspection process that inspects each left company pair after the filtering step. MW_Manual was cost prohibitive because the results of the filtering step contained too many non-competitor pairs. Inspecting such non-competitor pairs caused an overhead to the overall workload. To reduce the manual workload, especially the required human effort in the manual inspection process, Meltwater has transformed MW_Manual into a semi-automatic workflow (called MW_CPFilter) by replacing the manual filtering with an automatic yet more precise process that adopts a system called CPFilter. This paper presents CPFilter, a system used in the filtering process of MW_CPFilter. CPFilter automatically pre-computes likely competitor pairs from existing competitor pairs in Owler. CPFilter combines (i) the generation of new competitor candidate pairs by inference from existing competitors and other company-specific knowledge, with (ii) the validation of each candidate competitor pair of two companies by checking whether or not empirical evidence that indicates the competitor relationships of these two companies can be found. CPFilter has three key advantages compared with the manual filtering process and previous works: (i) it resulted in a high workload reduction rate of 0.81, (ii) it is domain-independent so that it can be applied to different sectors in Owler, and (iii) its results are explainable so that humans can easily understand its results.<\/jats:p>","DOI":"10.1145\/3589787","type":"journal-article","created":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T20:26:45Z","timestamp":1687292805000},"page":"1-23","source":"Crossref","is-referenced-by-count":0,"title":["When Automatic Filtering Comes to the Rescue: Pre-Computing Company Competitor Pairs in Owler"],"prefix":"10.1145","volume":"1","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1142-3610","authenticated-orcid":false,"given":"Jinsong","family":"Guo","sequence":"first","affiliation":[{"name":"University of Oxford &amp; Ratiolytics, Oxford, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-1171-8452","authenticated-orcid":false,"given":"Aditya","family":"Jami","sequence":"additional","affiliation":[{"name":"Meltwater, San Francisco, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-3217-0735","authenticated-orcid":false,"given":"Markus","family":"Kr\u00f6ll","sequence":"additional","affiliation":[{"name":"Meltwater, San Francisco, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1167-1777","authenticated-orcid":false,"given":"Lukas","family":"Schweizer","sequence":"additional","affiliation":[{"name":"Meltwater, San Francisco, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0079-6638","authenticated-orcid":false,"given":"Sergey","family":"Paramonov","sequence":"additional","affiliation":[{"name":"Meltwater, San Francisco, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4874-778X","authenticated-orcid":false,"given":"Eric","family":"Aichinger","sequence":"additional","affiliation":[{"name":"Meltwater, San Francisco, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9569-4428","authenticated-orcid":false,"given":"Stefano","family":"Sferrazza","sequence":"additional","affiliation":[{"name":"Meltwater, San Francisco, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3118-0588","authenticated-orcid":false,"given":"Mattia","family":"Scaccia","sequence":"additional","affiliation":[{"name":"Meltwater, San Francisco, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-1171-2994","authenticated-orcid":false,"given":"St\u00e9phane","family":"Reissfelder","sequence":"additional","affiliation":[{"name":"Meltwater, San Francisco, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-3763-137X","authenticated-orcid":false,"given":"Eda","family":"Cicek","sequence":"additional","affiliation":[{"name":"TU Wien, Vienna, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4350-0115","authenticated-orcid":false,"given":"Giovanni","family":"Grasso","sequence":"additional","affiliation":[{"name":"University of Calabria, Rende, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2353-5230","authenticated-orcid":false,"given":"Georg","family":"Gottlob","sequence":"additional","affiliation":[{"name":"University of Oxford &amp; Ratiolytics, Oxford, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,6,20]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3238304"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2008.98"},{"key":"e_1_2_2_3_1","volume-title":"Neural networks for entity matching: A survey. ACM Transactions on Knowledge Discovery from Data (TKDD)","author":"Barlaug Nils","year":"2021","unstructured":"Nils Barlaug and Jon Atle Gulla. 2021. Neural networks for entity matching: A survey. ACM Transactions on Knowledge Discovery from Data (TKDD), Vol. 15, 3 (2021), 1--37."},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2020.101528"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00011"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2021.10.021"},{"key":"e_1_2_2_7_1","doi-asserted-by":"crossref","unstructured":"Luigi Bellomarini Georg Gottlob Andreas Pieris and Emanuel Sallinger. 2017. Swift Logic for Big Data and Knowledge Graphs. In IJCAI.","DOI":"10.24963\/ijcai.2017\/1"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/3213880.3213888"},{"key":"e_1_2_2_9_1","volume-title":"22nd International Conference on Database Theory. 1.","author":"Bertossi Leopoldo","year":"2019","unstructured":"Leopoldo Bertossi, Georg Gottlob, and Reinhard Pichler. 2019. Datalog: Bag Semantics via Set Semantics. In 22nd International Conference on Database Theory. 1."},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956759"},{"key":"e_1_2_2_11_1","volume-title":"Thomas Lukasiewicz, Bruno Marnette, and Andreas Pieris.","author":"Cal Andrea","year":"2010","unstructured":"Andrea Cal`i, Georg Gottlob, Thomas Lukasiewicz, Bruno Marnette, and Andreas Pieris. 2010. Datalog\/-: A family of logical knowledge representation and query languages for new applications. In 2010 25th annual IEEE symposium on logic in computer science. IEEE, 228--242."},{"volume-title":"Logic programming and databases","author":"Ceri Stefano","key":"e_1_2_2_12_1","unstructured":"Stefano Ceri, Georg Gottlob, and Letizia Tanca. 2012. Logic programming and databases. Springer Science & Business Media."},{"key":"e_1_2_2_13_1","doi-asserted-by":"crossref","unstructured":"Stefano Ceri Georg Gottlob Letizia Tanca et al. 1989. What you always wanted to know about Datalog(and never dared to ask). IEEE transactions on knowledge and data engineering Vol. 1 1 (1989) 146--166.","DOI":"10.1109\/69.43410"},{"key":"e_1_2_2_14_1","volume-title":"Detecting Company Relations for Commercial Activities. In International Conference on Human-Computer Interaction. Springer, 42--52","author":"Chen Yi-Pei","year":"2019","unstructured":"Yi-Pei Chen, Ting-Lun Hsu, Wen-Kai Chung, Shih-Chieh Dai, and Lun-Wei Ku. 2019. Upstream, Downstream or Competitor? Detecting Company Relations for Commercial Activities. In International Conference on Human-Computer Interaction. Springer, 42--52."},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.48"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1177\/002224299906300305"},{"key":"e_1_2_2_17_1","volume-title":"Improving pointwise mutual information (pmi) by incorporating significant co-occurrence. arXiv preprint arXiv:1307.0596","author":"Damani Om P","year":"2013","unstructured":"Om P Damani. 2013. Improving pointwise mutual information (pmi) by incorporating significant co-occurrence. arXiv preprint arXiv:1307.0596 (2013)."},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-16268-3_31"},{"key":"e_1_2_2_19_1","volume-title":"DeepER--Deep Entity Resolution. arXiv preprint arXiv:1710.00597","author":"Ebraheem Muhammad","year":"2017","unstructured":"Muhammad Ebraheem, Saravanan Thirumuruganathan, Shafiq Joty, Mourad Ouzzani, and Nan Tang. 2017. DeepER--Deep Entity Resolution. arXiv preprint arXiv:1710.00597 (2017)."},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.14778\/3236187.3236198"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.250581"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-012-0286-6"},{"key":"e_1_2_2_23_1","first-page":"26","article-title":"Top-K competitor trust mining and customer behavior investigation using data mining technique","volume":"8","author":"Joseph Nisha","year":"2018","unstructured":"Nisha Joseph and B Senthil Kumar. 2018. Top-K competitor trust mining and customer behavior investigation using data mining technique. Journal of Network Communications and Emerging Technologies (JNCET), Vol. 8, 2 (2018), 26--30.","journal-title":"Journal of Network Communications and Emerging Technologies (JNCET)"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339599"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/11811305_87"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.38"},{"key":"e_1_2_2_27_1","volume-title":"Deep entity matching with pre-trained language models. arXiv preprint arXiv:2004.00584","author":"Li Yuliang","year":"2020","unstructured":"Yuliang Li, Jinfeng Li, Yoshihiko Suhara, AnHai Doan, and Wang-Chiew Tan. 2020. Deep entity matching with pre-trained language models. arXiv preprint arXiv:2004.00584 (2020)."},{"key":"e_1_2_2_28_1","volume-title":"Rebecca Isaacs, and Michael Isard.","author":"McSherry Frank","year":"2013","unstructured":"Frank McSherry, Derek Gordon Murray, Rebecca Isaacs, and Michael Isard. 2013. Differential Dataflow.. In CIDR."},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196926"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/1841211"},{"key":"e_1_2_2_31_1","unstructured":"Maximilian Nickel Volker Tresp and Hans-Peter Kriegel. 2011. A three-way model for collective learning on multi-relational data. In Icml."},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1287\/isre.2014.0563"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377455"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.2307\/258155"},{"key":"e_1_2_2_35_1","volume-title":"Implicit Business Competitor Inference Using Heterogeneous Knowledge Graph. In 2021 IEEE International Conference on Big Knowledge (ICBK). IEEE, 198--205","author":"Qin Wei","year":"2021","unstructured":"Wei Qin, Xiangfeng Luo, and Hao Wang. 2021. Implicit Business Competitor Inference Using Heterogeneous Knowledge Graph. In 2021 IEEE International Conference on Big Knowledge (ICBK). IEEE, 198--205."},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3373509.3373542"},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113340"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.14778\/3149193.3149199"},{"key":"e_1_2_2_39_1","volume-title":"International conference on machine learning. PMLR","author":"Trouillon Th\u00e9o","year":"2016","unstructured":"Th\u00e9o Trouillon, Johannes Welbl, Sebastian Riedel, \u00c9ric Gaussier, and Guillaume Bouchard. 2016. Complex embeddings for simple link prediction. In International conference on machine learning. PMLR, 2071--2080."},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.14778\/3554821.3554870"},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2705101"},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.14778\/2021017.2021020"},{"key":"e_1_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.3390\/sym13030485"}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589787","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3589787","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:49:22Z","timestamp":1750182562000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589787"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,13]]},"references-count":43,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,6,13]]}},"alternative-id":["10.1145\/3589787"],"URL":"https:\/\/doi.org\/10.1145\/3589787","relation":{},"ISSN":["2836-6573"],"issn-type":[{"type":"electronic","value":"2836-6573"}],"subject":[],"published":{"date-parts":[[2023,6,13]]}}}