9 Citations (Scopus)

Abstract

The nature of the Blogosphere determines that the majority of bloggers are only connected with a small number of fellow bloggers, and similar bloggers can be largely disconnected from each other. Aggregating them allows for cost-effective personalized services, targeted marketing, and exploration of new business opportunities. As most bloggers have only a small number of adjacent bloggers, the problem of aggregating similar bloggers presents challenges that demand novel algorithms of connecting the non-adjacent due to the fragmented distributions of bloggers. In this work, we define the problem, delineate its challenges, and present an approach that uses innovative ways to employ contextual information and collective wisdom to aggregate similar bloggers. A real-world blog directory is used for experiments. We demonstrate the efficacy of our approach, report findings, and discuss related issues and future work.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE International Conference on Data Mining, ICDM
Pages11-20
Number of pages10
DOIs
StatePublished - 2009
Event9th IEEE International Conference on Data Mining, ICDM 2009 - Miami, FL, United States
Duration: Dec 6 2009Dec 9 2009

Other

Other9th IEEE International Conference on Data Mining, ICDM 2009
CountryUnited States
CityMiami, FL
Period12/6/0912/9/09

Fingerprint

Blogs
Marketing
Costs
Industry
Experiments

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Agarwal, N., Liu, H., Subramanya, S., Salerno, J. J., & Yu, P. S. (2009). Connecting sparsely distributed similar bloggers. In Proceedings - IEEE International Conference on Data Mining, ICDM (pp. 11-20). [5360226] https://doi.org/10.1109/ICDM.2009.38

Connecting sparsely distributed similar bloggers. / Agarwal, Nitin; Liu, Huan; Subramanya, Shankara; Salerno, John J.; Yu, Philip S.

Proceedings - IEEE International Conference on Data Mining, ICDM. 2009. p. 11-20 5360226.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Agarwal, N, Liu, H, Subramanya, S, Salerno, JJ & Yu, PS 2009, Connecting sparsely distributed similar bloggers. in Proceedings - IEEE International Conference on Data Mining, ICDM., 5360226, pp. 11-20, 9th IEEE International Conference on Data Mining, ICDM 2009, Miami, FL, United States, 12/6/09. https://doi.org/10.1109/ICDM.2009.38
Agarwal N, Liu H, Subramanya S, Salerno JJ, Yu PS. Connecting sparsely distributed similar bloggers. In Proceedings - IEEE International Conference on Data Mining, ICDM. 2009. p. 11-20. 5360226 https://doi.org/10.1109/ICDM.2009.38
Agarwal, Nitin ; Liu, Huan ; Subramanya, Shankara ; Salerno, John J. ; Yu, Philip S. / Connecting sparsely distributed similar bloggers. Proceedings - IEEE International Conference on Data Mining, ICDM. 2009. pp. 11-20
@inproceedings{dcafd6ba2322407580f10dde26140cea,
title = "Connecting sparsely distributed similar bloggers",
abstract = "The nature of the Blogosphere determines that the majority of bloggers are only connected with a small number of fellow bloggers, and similar bloggers can be largely disconnected from each other. Aggregating them allows for cost-effective personalized services, targeted marketing, and exploration of new business opportunities. As most bloggers have only a small number of adjacent bloggers, the problem of aggregating similar bloggers presents challenges that demand novel algorithms of connecting the non-adjacent due to the fragmented distributions of bloggers. In this work, we define the problem, delineate its challenges, and present an approach that uses innovative ways to employ contextual information and collective wisdom to aggregate similar bloggers. A real-world blog directory is used for experiments. We demonstrate the efficacy of our approach, report findings, and discuss related issues and future work.",
author = "Nitin Agarwal and Huan Liu and Shankara Subramanya and Salerno, {John J.} and Yu, {Philip S.}",
year = "2009",
doi = "10.1109/ICDM.2009.38",
language = "English (US)",
isbn = "9780769538952",
pages = "11--20",
booktitle = "Proceedings - IEEE International Conference on Data Mining, ICDM",

}

TY - GEN

T1 - Connecting sparsely distributed similar bloggers

AU - Agarwal, Nitin

AU - Liu, Huan

AU - Subramanya, Shankara

AU - Salerno, John J.

AU - Yu, Philip S.

PY - 2009

Y1 - 2009

N2 - The nature of the Blogosphere determines that the majority of bloggers are only connected with a small number of fellow bloggers, and similar bloggers can be largely disconnected from each other. Aggregating them allows for cost-effective personalized services, targeted marketing, and exploration of new business opportunities. As most bloggers have only a small number of adjacent bloggers, the problem of aggregating similar bloggers presents challenges that demand novel algorithms of connecting the non-adjacent due to the fragmented distributions of bloggers. In this work, we define the problem, delineate its challenges, and present an approach that uses innovative ways to employ contextual information and collective wisdom to aggregate similar bloggers. A real-world blog directory is used for experiments. We demonstrate the efficacy of our approach, report findings, and discuss related issues and future work.

AB - The nature of the Blogosphere determines that the majority of bloggers are only connected with a small number of fellow bloggers, and similar bloggers can be largely disconnected from each other. Aggregating them allows for cost-effective personalized services, targeted marketing, and exploration of new business opportunities. As most bloggers have only a small number of adjacent bloggers, the problem of aggregating similar bloggers presents challenges that demand novel algorithms of connecting the non-adjacent due to the fragmented distributions of bloggers. In this work, we define the problem, delineate its challenges, and present an approach that uses innovative ways to employ contextual information and collective wisdom to aggregate similar bloggers. A real-world blog directory is used for experiments. We demonstrate the efficacy of our approach, report findings, and discuss related issues and future work.

UR - http://www.scopus.com/inward/record.url?scp=77951160132&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77951160132&partnerID=8YFLogxK

U2 - 10.1109/ICDM.2009.38

DO - 10.1109/ICDM.2009.38

M3 - Conference contribution

AN - SCOPUS:77951160132

SN - 9780769538952

SP - 11

EP - 20

BT - Proceedings - IEEE International Conference on Data Mining, ICDM

ER -