Skip to main content
Erschienen in: Journal of Combinatorial Optimization 3/2014

01.10.2014

Neighborhood-based uncertainty generation in social networks

verfasst von: Meng Han, Mingyuan Yan, Jinbao Li, Shouling Ji, Yingshu Li

Erschienen in: Journal of Combinatorial Optimization | Ausgabe 3/2014

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Imprecision, incompleteness and dynamic exist in a wide range of network applications. It is difficult to decide the uncertainty relationship among nodes since traditional models are not meaningful in uncertain networks, and the inherent computational complexity of the problems with uncertainty is always intractable. In this paper, we study how to capture uncertainty in networks by transforming a series of snapshots of a network to an uncertain graph. A novel sampling scheme is also proposed which enables the development of efficient algorithms to measure uncertainty in networks. Considering the practical aspects of neighborhood relationship in real networks, a framework is introduced to transform an uncertain network into a deterministic weighted network where the weights on edges can be measured by Jaccard-like index. The comprehensive experimental evaluation results on real data demonstrate the effectiveness and efficiency of our algorithms.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literatur
Zurück zum Zitat Aggarwal CC, Yu PS (2009) A survey of uncertain data algorithms and applications. IEEE Trans Knowl Data Eng 21(5):609–623CrossRef Aggarwal CC, Yu PS (2009) A survey of uncertain data algorithms and applications. IEEE Trans Knowl Data Eng 21(5):609–623CrossRef
Zurück zum Zitat Bortner D, Han J (2010) Progressive clustering of networks using structure-connected order of traversal. In: IEEE the international conference on data engineering ICDE, pp. 653–656 Bortner D, Han J (2010) Progressive clustering of networks using structure-connected order of traversal. In: IEEE the international conference on data engineering ICDE, pp. 653–656
Zurück zum Zitat Burton S, Morris R, Dimond M, Hansen J, Giraud-Carrier C, West J, Hanson C, Barnes M (2010) Public health community mining in YouTube. In: Proceedings of the 2nd ACM SIGHIT symposium on international health informatics, pp. 81–90 Burton S, Morris R, Dimond M, Hansen J, Giraud-Carrier C, West J, Hanson C, Barnes M (2010) Public health community mining in YouTube. In: Proceedings of the 2nd ACM SIGHIT symposium on international health informatics, pp. 81–90
Zurück zum Zitat Cai Z, Lin G, Xue G (2005) Improved approximation algorithms for the capacitated multicast routing problem. In: COCOON, pp. 136–145 Cai Z, Lin G, Xue G (2005) Improved approximation algorithms for the capacitated multicast routing problem. In: COCOON, pp. 136–145
Zurück zum Zitat Cheng S, Li J, Cai Z (2013) \(O(\epsilon )\)-Approximation to physical world by sensor networks. In: INFOCOM, pp. 3084–3092 Cheng S, Li J, Cai Z (2013) \(O(\epsilon )\)-Approximation to physical world by sensor networks. In: INFOCOM, pp. 3084–3092
Zurück zum Zitat Chernoff H (1952) A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann Math Stat 23(4):493–507CrossRefMATHMathSciNet Chernoff H (1952) A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann Math Stat 23(4):493–507CrossRefMATHMathSciNet
Zurück zum Zitat Hintsanen P, Toivonen H (2008) Finding reliable subgraphs from large probabilistic graphs. Data Min Knowl Discov 17(1):3–23CrossRefMathSciNet Hintsanen P, Toivonen H (2008) Finding reliable subgraphs from large probabilistic graphs. Data Min Knowl Discov 17(1):3–23CrossRefMathSciNet
Zurück zum Zitat Jin R, Liu L, Ding B, Wang H (2011) Distance-constraint reachability computation in uncertain graphs. Proc VLDB Endow 4(9):551–562CrossRef Jin R, Liu L, Ding B, Wang H (2011) Distance-constraint reachability computation in uncertain graphs. Proc VLDB Endow 4(9):551–562CrossRef
Zurück zum Zitat Jin R, Liu L, Aggarwal CC (2011) Discovering highly reliable subgraphs in uncertain graphs. In: Proceedings of the 17th ACM SIGKDD international conference on knowledge discovery and data mining, pp. 992–1000 Jin R, Liu L, Aggarwal CC (2011) Discovering highly reliable subgraphs in uncertain graphs. In: Proceedings of the 17th ACM SIGKDD international conference on knowledge discovery and data mining, pp. 992–1000
Zurück zum Zitat Lancichinetti A, Fortunato S (2009) Community detection algorithms: a comparative analysis. Phys Rev E 80:56–117 Lancichinetti A, Fortunato S (2009) Community detection algorithms: a comparative analysis. Phys Rev E 80:56–117
Zurück zum Zitat Li J, Zou Z, Gao H (2012) Mining frequent subgraphs over uncertain graph databases under probabilistic semantics. VLDB J 21(6):753–777CrossRef Li J, Zou Z, Gao H (2012) Mining frequent subgraphs over uncertain graph databases under probabilistic semantics. VLDB J 21(6):753–777CrossRef
Zurück zum Zitat Potamias M, Bonchi F, Gionis A, Kollios G (2010) K-nearest neighbors in uncertain graphs. Proc VLDB Endow 3(1–2):997–1008CrossRef Potamias M, Bonchi F, Gionis A, Kollios G (2010) K-nearest neighbors in uncertain graphs. Proc VLDB Endow 3(1–2):997–1008CrossRef
Zurück zum Zitat Ross SM (2009) Introduction to probability models. Academic press, Orlando Ross SM (2009) Introduction to probability models. Academic press, Orlando
Zurück zum Zitat Xu K, Zhang X (2012) Mining community in mobile social network. Procedia Eng 29:3080–3084CrossRef Xu K, Zhang X (2012) Mining community in mobile social network. Procedia Eng 29:3080–3084CrossRef
Zurück zum Zitat Xu X, Yuruk N, Feng Z, Schweiger TAJ (2007) Scan: a structural clustering algorithm for networks. In: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 824–833 Xu X, Yuruk N, Feng Z, Schweiger TAJ (2007) Scan: a structural clustering algorithm for networks. In: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 824–833
Zurück zum Zitat Yuan Y, Chen L, Wang G (2010) Efficiently answering probability threshold-based shortest path queries over uncertain graphs. In: Proceedings of DASFAA, Berlin, Springer, pp. 155–70 Yuan Y, Chen L, Wang G (2010) Efficiently answering probability threshold-based shortest path queries over uncertain graphs. In: Proceedings of DASFAA, Berlin, Springer, pp. 155–70
Zurück zum Zitat Zou Z, Li J, Gao H, Zhang S (2010) Mining frequent subgraph patterns from uncertain graph data. IEEE Trans Knowl Data Eng 22(9):1203–1218CrossRef Zou Z, Li J, Gao H, Zhang S (2010) Mining frequent subgraph patterns from uncertain graph data. IEEE Trans Knowl Data Eng 22(9):1203–1218CrossRef
Zurück zum Zitat Zou Z, Li J, Gao H, Zhang Sh (2009) Frequent subgraph pattern mining on uncertain graph data. In: CIKM, pp. 583–592 Zou Z, Li J, Gao H, Zhang Sh (2009) Frequent subgraph pattern mining on uncertain graph data. In: CIKM, pp. 583–592
Metadaten
Titel
Neighborhood-based uncertainty generation in social networks
verfasst von
Meng Han
Mingyuan Yan
Jinbao Li
Shouling Ji
Yingshu Li
Publikationsdatum
01.10.2014
Verlag
Springer US
Erschienen in
Journal of Combinatorial Optimization / Ausgabe 3/2014
Print ISSN: 1382-6905
Elektronische ISSN: 1573-2886
DOI
https://doi.org/10.1007/s10878-013-9684-y

Weitere Artikel der Ausgabe 3/2014

Journal of Combinatorial Optimization 3/2014 Zur Ausgabe

Premium Partner