Loading…
Max-Intensity: Detecting Competitive Advertiser Communities in Sponsored Search Market
In a sponsored search market, the problem of measuring the intensity of competition among advertisers is increasingly gaining prominence today. Usually, search providers want to monitor the advertiser communities that share common bidding keywords, so that they can intervene when competition slacken...
Saved in:
Main Authors: | , , , , , |
---|---|
Format: | Conference Proceeding |
Language: | English |
Subjects: | |
Online Access: | Request full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | |
---|---|
cites | |
container_end_page | 578 |
container_issue | |
container_start_page | 569 |
container_title | |
container_volume | |
creator | Wenchao Yu Das, Ariyam Wood, Justin Wei Wang Zaniolo, Carlo Ping Luo |
description | In a sponsored search market, the problem of measuring the intensity of competition among advertisers is increasingly gaining prominence today. Usually, search providers want to monitor the advertiser communities that share common bidding keywords, so that they can intervene when competition slackens. However, to the best of our knowledge, not much research has been conducted in identifying advertiser communities and understanding competition within these communities. In this paper we introduce a novel approach to detect competitive communities in a weighted bi-partite network formed by advertisers and their bidding keywords. The proposed approach is based on an advertiser vertex metric called intensity score, which takes the following two factors into consideration: the competitors that bid on the same keywords, and the advertisers' consumption proportion within the community. Evidence shows that when market competition rises, the revenue for a search provider also increases. Our community detection algorithm Max-Intensity is designed to detect communities which have the maximum intensity score. In this paper, we conduct experiments and validate the performance of Max-Intensity on sponsored search advertising data. Compared to baseline methods, the communities detected by our algorithm have low Herfindahl-Hirschman index (HHI) and comprehensive concentration index (CCI), which demonstrates that the communities given by Max-Intensity can capture the structure of the competitive communities. |
doi_str_mv | 10.1109/ICDM.2015.128 |
format | conference_proceeding |
fullrecord | <record><control><sourceid>proquest_CHZPO</sourceid><recordid>TN_cdi_ieee_primary_7373361</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>7373361</ieee_id><sourcerecordid>1793246509</sourcerecordid><originalsourceid>FETCH-LOGICAL-i208t-3ab3c34e19ee2e12529bc3a6294d6c47170cea1f7efc50932fe7759546882a2a3</originalsourceid><addsrcrecordid>eNotjEtPAjEYRavRRIIsXbmZpZvBvh_uyOCDBOICdTsp5RttZDpjW4j8eyG4usnJPQehG4LHhGBzP6umizHFRIwJ1WdoZJQmXCpmBGb6HA0oU7zUXMsLNCBC4JIrLa_QKCW_wlQqyQ1WA_SxsL_lLGQIyef9QzGFDC778FlUXdtD9tnvoJisdxCzTxCPuN2GA4ZU-FAs-y6kLsK6WIKN7qtY2PgN-RpdNnaTYPS_Q_T-9PhWvZTz1-dZNZmXnmKdS2ZXzDEOxABQIFRQs3LMSmr4WjquiMIOLGkUNE5gw2gDSgkjuNSaWmrZEN2dun3sfraQct365GCzsQG6baqJOkhcHt0huj1dPQDUffStjftaMcWYJOwPc69hZA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype><pqid>1793246509</pqid></control><display><type>conference_proceeding</type><title>Max-Intensity: Detecting Competitive Advertiser Communities in Sponsored Search Market</title><source>IEEE Xplore All Conference Series</source><creator>Wenchao Yu ; Das, Ariyam ; Wood, Justin ; Wei Wang ; Zaniolo, Carlo ; Ping Luo</creator><creatorcontrib>Wenchao Yu ; Das, Ariyam ; Wood, Justin ; Wei Wang ; Zaniolo, Carlo ; Ping Luo</creatorcontrib><description>In a sponsored search market, the problem of measuring the intensity of competition among advertisers is increasingly gaining prominence today. Usually, search providers want to monitor the advertiser communities that share common bidding keywords, so that they can intervene when competition slackens. However, to the best of our knowledge, not much research has been conducted in identifying advertiser communities and understanding competition within these communities. In this paper we introduce a novel approach to detect competitive communities in a weighted bi-partite network formed by advertisers and their bidding keywords. The proposed approach is based on an advertiser vertex metric called intensity score, which takes the following two factors into consideration: the competitors that bid on the same keywords, and the advertisers' consumption proportion within the community. Evidence shows that when market competition rises, the revenue for a search provider also increases. Our community detection algorithm Max-Intensity is designed to detect communities which have the maximum intensity score. In this paper, we conduct experiments and validate the performance of Max-Intensity on sponsored search advertising data. Compared to baseline methods, the communities detected by our algorithm have low Herfindahl-Hirschman index (HHI) and comprehensive concentration index (CCI), which demonstrates that the communities given by Max-Intensity can capture the structure of the competitive communities.</description><identifier>ISSN: 1550-4786</identifier><identifier>EISSN: 2374-8486</identifier><identifier>EISBN: 9781467395038</identifier><identifier>EISBN: 146739503X</identifier><identifier>EISBN: 9781467395045</identifier><identifier>EISBN: 1467395048</identifier><identifier>DOI: 10.1109/ICDM.2015.128</identifier><identifier>CODEN: IEEPAD</identifier><language>eng</language><publisher>IEEE</publisher><subject>Algorithms ; Communities ; Competition ; Competition Coefficient ; Competition Community Detection ; Conferences ; Correlation ; Data mining ; Data models ; Detection algorithms ; Indexes ; Markets ; Max-Intensity ; Measurement ; Monitoring ; Performance indices ; Search engines ; Searching ; Sponsored Search</subject><ispartof>2015 IEEE International Conference on Data Mining, 2015, p.569-578</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/7373361$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,314,776,780,785,786,27901,27902,54530,54907</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/7373361$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Wenchao Yu</creatorcontrib><creatorcontrib>Das, Ariyam</creatorcontrib><creatorcontrib>Wood, Justin</creatorcontrib><creatorcontrib>Wei Wang</creatorcontrib><creatorcontrib>Zaniolo, Carlo</creatorcontrib><creatorcontrib>Ping Luo</creatorcontrib><title>Max-Intensity: Detecting Competitive Advertiser Communities in Sponsored Search Market</title><title>2015 IEEE International Conference on Data Mining</title><addtitle>ICDM</addtitle><description>In a sponsored search market, the problem of measuring the intensity of competition among advertisers is increasingly gaining prominence today. Usually, search providers want to monitor the advertiser communities that share common bidding keywords, so that they can intervene when competition slackens. However, to the best of our knowledge, not much research has been conducted in identifying advertiser communities and understanding competition within these communities. In this paper we introduce a novel approach to detect competitive communities in a weighted bi-partite network formed by advertisers and their bidding keywords. The proposed approach is based on an advertiser vertex metric called intensity score, which takes the following two factors into consideration: the competitors that bid on the same keywords, and the advertisers' consumption proportion within the community. Evidence shows that when market competition rises, the revenue for a search provider also increases. Our community detection algorithm Max-Intensity is designed to detect communities which have the maximum intensity score. In this paper, we conduct experiments and validate the performance of Max-Intensity on sponsored search advertising data. Compared to baseline methods, the communities detected by our algorithm have low Herfindahl-Hirschman index (HHI) and comprehensive concentration index (CCI), which demonstrates that the communities given by Max-Intensity can capture the structure of the competitive communities.</description><subject>Algorithms</subject><subject>Communities</subject><subject>Competition</subject><subject>Competition Coefficient</subject><subject>Competition Community Detection</subject><subject>Conferences</subject><subject>Correlation</subject><subject>Data mining</subject><subject>Data models</subject><subject>Detection algorithms</subject><subject>Indexes</subject><subject>Markets</subject><subject>Max-Intensity</subject><subject>Measurement</subject><subject>Monitoring</subject><subject>Performance indices</subject><subject>Search engines</subject><subject>Searching</subject><subject>Sponsored Search</subject><issn>1550-4786</issn><issn>2374-8486</issn><isbn>9781467395038</isbn><isbn>146739503X</isbn><isbn>9781467395045</isbn><isbn>1467395048</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2015</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotjEtPAjEYRavRRIIsXbmZpZvBvh_uyOCDBOICdTsp5RttZDpjW4j8eyG4usnJPQehG4LHhGBzP6umizHFRIwJ1WdoZJQmXCpmBGb6HA0oU7zUXMsLNCBC4JIrLa_QKCW_wlQqyQ1WA_SxsL_lLGQIyef9QzGFDC778FlUXdtD9tnvoJisdxCzTxCPuN2GA4ZU-FAs-y6kLsK6WIKN7qtY2PgN-RpdNnaTYPS_Q_T-9PhWvZTz1-dZNZmXnmKdS2ZXzDEOxABQIFRQs3LMSmr4WjquiMIOLGkUNE5gw2gDSgkjuNSaWmrZEN2dun3sfraQct365GCzsQG6baqJOkhcHt0huj1dPQDUffStjftaMcWYJOwPc69hZA</recordid><startdate>20151101</startdate><enddate>20151101</enddate><creator>Wenchao Yu</creator><creator>Das, Ariyam</creator><creator>Wood, Justin</creator><creator>Wei Wang</creator><creator>Zaniolo, Carlo</creator><creator>Ping Luo</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20151101</creationdate><title>Max-Intensity: Detecting Competitive Advertiser Communities in Sponsored Search Market</title><author>Wenchao Yu ; Das, Ariyam ; Wood, Justin ; Wei Wang ; Zaniolo, Carlo ; Ping Luo</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i208t-3ab3c34e19ee2e12529bc3a6294d6c47170cea1f7efc50932fe7759546882a2a3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2015</creationdate><topic>Algorithms</topic><topic>Communities</topic><topic>Competition</topic><topic>Competition Coefficient</topic><topic>Competition Community Detection</topic><topic>Conferences</topic><topic>Correlation</topic><topic>Data mining</topic><topic>Data models</topic><topic>Detection algorithms</topic><topic>Indexes</topic><topic>Markets</topic><topic>Max-Intensity</topic><topic>Measurement</topic><topic>Monitoring</topic><topic>Performance indices</topic><topic>Search engines</topic><topic>Searching</topic><topic>Sponsored Search</topic><toplevel>online_resources</toplevel><creatorcontrib>Wenchao Yu</creatorcontrib><creatorcontrib>Das, Ariyam</creatorcontrib><creatorcontrib>Wood, Justin</creatorcontrib><creatorcontrib>Wei Wang</creatorcontrib><creatorcontrib>Zaniolo, Carlo</creatorcontrib><creatorcontrib>Ping Luo</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE/IET Electronic Library</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Wenchao Yu</au><au>Das, Ariyam</au><au>Wood, Justin</au><au>Wei Wang</au><au>Zaniolo, Carlo</au><au>Ping Luo</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Max-Intensity: Detecting Competitive Advertiser Communities in Sponsored Search Market</atitle><btitle>2015 IEEE International Conference on Data Mining</btitle><stitle>ICDM</stitle><date>2015-11-01</date><risdate>2015</risdate><spage>569</spage><epage>578</epage><pages>569-578</pages><issn>1550-4786</issn><eissn>2374-8486</eissn><eisbn>9781467395038</eisbn><eisbn>146739503X</eisbn><eisbn>9781467395045</eisbn><eisbn>1467395048</eisbn><coden>IEEPAD</coden><abstract>In a sponsored search market, the problem of measuring the intensity of competition among advertisers is increasingly gaining prominence today. Usually, search providers want to monitor the advertiser communities that share common bidding keywords, so that they can intervene when competition slackens. However, to the best of our knowledge, not much research has been conducted in identifying advertiser communities and understanding competition within these communities. In this paper we introduce a novel approach to detect competitive communities in a weighted bi-partite network formed by advertisers and their bidding keywords. The proposed approach is based on an advertiser vertex metric called intensity score, which takes the following two factors into consideration: the competitors that bid on the same keywords, and the advertisers' consumption proportion within the community. Evidence shows that when market competition rises, the revenue for a search provider also increases. Our community detection algorithm Max-Intensity is designed to detect communities which have the maximum intensity score. In this paper, we conduct experiments and validate the performance of Max-Intensity on sponsored search advertising data. Compared to baseline methods, the communities detected by our algorithm have low Herfindahl-Hirschman index (HHI) and comprehensive concentration index (CCI), which demonstrates that the communities given by Max-Intensity can capture the structure of the competitive communities.</abstract><pub>IEEE</pub><doi>10.1109/ICDM.2015.128</doi><tpages>10</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 1550-4786 |
ispartof | 2015 IEEE International Conference on Data Mining, 2015, p.569-578 |
issn | 1550-4786 2374-8486 |
language | eng |
recordid | cdi_ieee_primary_7373361 |
source | IEEE Xplore All Conference Series |
subjects | Algorithms Communities Competition Competition Coefficient Competition Community Detection Conferences Correlation Data mining Data models Detection algorithms Indexes Markets Max-Intensity Measurement Monitoring Performance indices Search engines Searching Sponsored Search |
title | Max-Intensity: Detecting Competitive Advertiser Communities in Sponsored Search Market |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-05T23%3A59%3A13IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_CHZPO&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Max-Intensity:%20Detecting%20Competitive%20Advertiser%20Communities%20in%20Sponsored%20Search%20Market&rft.btitle=2015%20IEEE%20International%20Conference%20on%20Data%20Mining&rft.au=Wenchao%20Yu&rft.date=2015-11-01&rft.spage=569&rft.epage=578&rft.pages=569-578&rft.issn=1550-4786&rft.eissn=2374-8486&rft.coden=IEEPAD&rft_id=info:doi/10.1109/ICDM.2015.128&rft.eisbn=9781467395038&rft.eisbn_list=146739503X&rft.eisbn_list=9781467395045&rft.eisbn_list=1467395048&rft_dat=%3Cproquest_CHZPO%3E1793246509%3C/proquest_CHZPO%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i208t-3ab3c34e19ee2e12529bc3a6294d6c47170cea1f7efc50932fe7759546882a2a3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1793246509&rft_id=info:pmid/&rft_ieee_id=7373361&rfr_iscdi=true |