Optimization algorithms for energy-efficient data centers
Hendrik F. Hamann
InterPACK 2013
Network and linked data have become quite prevalent in recent years because of the ubiquity of the web and social media applications, which are inherently network oriented. Such networks are massive, dynamic, contain a lot of content, and may evolve over time. In this paper, we will study the problem of efficient dynamic link inference in temporal and heterogeneous information networks. The problem of efficiently performing dynamic link inference is extremely challenging in massive and heterogeneous information network because of the challenges associated with the dynamic nature of the network, and the different types of nodes and attributes in it. Both the topology and type information need to be used effectively for the link inference process. We propose an effective two-level scheme which makes efficient macro- and micro-decisions for combining structure and content in a dynamic and time-sensitive way. The time-sensitive nature of the links is leveraged in order to perform effective link prediction. We will also study how to apply the method to the problem of community prediction. We illustrate the effectiveness of our technique over a number of real data sets. © 2013 Wiley Periodicals, Inc.
Hendrik F. Hamann
InterPACK 2013
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009
Marshall W. Bern, Howard J. Karloff, et al.
Theoretical Computer Science
Michael C. McCord, Violetta Cavalli-Sforza
ACL 2007