VoidWiz: Resolving incompleteness using network effects

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2014, Pages 1230-1233

  Christodoulakis, Christina ^a   Faloutsos, Christos ^b   Miller, Renée J ^a  

^a UNIVERSITY OF TORONTO   (Canada)

^b Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INDUSTRIAL ENGINEERING;

BELIEF PROPAGATION ALGORITHM; BUSINESS ANALYTICS; DATA-SOURCES; GRAPH NETWORKS; LINK PREDICTION; MISSING VALUES; NETWORK EFFECTS;

ENGINEERING;

EID: 84901785034     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2014.6816748     Document Type: Conference Paper

References (15)

1. P. C. Arocena, B. Glavic, and R. J. Miller, "Value invention in data exchange," in SIGMOD, 2013, pp. 157-168.
2. J. S. Yedidia, W. T. Freeman, and Y. Weiss, "Understanding belief propagation and its generalizations," Exploring artificial intelligence in the new millennium, vol. 8, pp. 236-239, 2003.
3. S. Yeganeh, O. Hassanzadeh, and R. J. Miller, "Linking semistructred data on the web," in Workshop on the Web and Databases, 2011.
4. B. Shneiderman, "The eyes have it: A task by data type taxonomy for information visualizations," in Visual Languages, 1996. Proceedings., IEEE Symposium on. IEEE, 1996, pp. 336-343.
5. M. Volkovs, C. Fei, J. Szlichta, and R. J. Miller, "Continuous data cleaning," in ICDE, 2014.
6. C. Faloutsos, K. S. McCurley, and A. Tomkins, "Fast discovery of connection subgraphs," in Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 2004, pp. 118-127.
7. M. Bostock, V. Ogievetsky, and J. Heer, "D3: Data-driven documents," IEEE Trans. Visualization & Comp. Graphics (Proc. InfoVis), 2011. [Online]. Available: http://vis.stanford.edu/papers/d3
8. L. Getoor and C. P. Diehl, "Link mining: a survey," SIGKDD Explor. Newsl., vol. 7, no. 2, pp. 3-12, Dec. 2005. [Online]. Available: http://doi.acm.org/10.1145/1117454.1117456
9. Z. Yin, M. Gupta, T. Weninger, and J. Han, "A unified framework for link recommendation using random walks," in Advances in Social Networks Analysis and Mining (ASONAM), 2010 International Conference on. IEEE, 2010, pp. 152-159.
10. H. Tong, C. Faloutsos, and J.-Y. Pan, "Random walk with restart: fast solutions and applications," Knowledge and Information Systems, vol. 14, no. 3, pp. 327-346, 2008.
11. L. Backstrom and J. Leskovec, "Supervised random walks: predicting and recommending links in social networks," in Proceedings of the fourth ACM international conference on Web search and data mining, ser. WSDM '11. New York, NY, USA: ACM, 2011, pp. 635-644. [Online]. Available: http://doi.acm.org/ 10.1145/1935826.1935914
12. T. H. Haveliwala, "Topic-sensitive pagerank: A context-sensitive ranking algorithm for web search," Knowledge and Data Engineering, IEEE Transactions on, vol. 15, no. 4, pp. 784-796, 2003.
13. K. Avrachenkov, N. Litvak, D. Nemirovsky, E. Smirnova, and M. Sokol, "Quick detection of top-k personalized pagerank lists," in Algorithms and Models for the Web Graph. Springer, 2011, pp. 50-61.
14. F. Geerts, H. Mannila, and E. Terzi, "Relational link-based ranking," in Proceedings of the Thirtieth international conference on Very large data bases-Volume 30. VLDB Endowment, 2004, pp. 552-563.
15. A. Balmin, V. Hristidis, and Y. Papakonstantinou, "Objectrank: Authority-based keyword search in databases," in Proceedings of the Thirtieth international conference on Very large data bases-Volume 30. VLDB Endowment, 2004, pp. 564-575.