The time-series link prediction problem with applications in communication surveillance

INFORMS Journal on Computing

Volumn 21, Issue 2, 2009, Pages 286-303

  Huang, Zan ^a   Lin, Dennis K J ^a  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

Analysis of algorithms; Communication networks; Link prediction; Statistical analysis; Time series analysis

Indexed keywords

EID: 67649958523     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1080.0292     Document Type: Article

References (42)

1. Adamic, L., E. Adar. 2003. Friends and neighbors on the Web. Soc. Networks 25(3) 211-230.
2. Akaike, H. 1974. A new look at the statistical model identification. IEEE Trans. Automatic Control 19(6) 716-723.
3. Alwan, L. C., H. V. Roberts. 1988. Time-series modeling for statistical process control. J. Bus. Econom. Statist. 6(1) 87-95.
4. Barabasi, A.-L., R. Albert. 1999. Emergence of scaling in random networks. Science 286(5439) 509-512.
5. Berger-Wolf, T. Y., J. Saia. 2006. A framework for analysis of dynamic social networks. Proc. 12th ACM SIGKDD Internat. Conf. Knowledge Discovery and Data Mining, Philadelphia, ACM, New York, 523-528.
6. Bolot, J.-C., P. Hoschka. 1996. Performance engineering of theWorld Wide Web: Application to dimensioning and cache design. Comput. Networks ISDN Systems 28(7-11) 1397-1405.
7. Box, G. E. P., G. Jenkins. 1970. Time Series Analysis, Forecasting, and Control. Holden-Day, Oakland, CA.
8. Bradley, A. P. 1997. The use of the area under the ROC curve in the evaluation of machine learning algorithms. Pattern Recognition 30(7) 1145-1159.
9. Dempster, A., N. Laird, D. Rubin. 1977. Maximum likelihood from incomplete data via the EMalgorithm. J. Roy. Statist. Soc. Ser. B 39(1) 1-38.
10. Domingos, P., M. Richardson. 2001. Mining the network value of customers. Proc. Seventh ACM SIGKDD Internat. Conf. Knowledge Discovery and Data Mining, San Francisco, ACM, New York, 57-66.
11. Dzeroski, S., N. Lavrac. 2001. Relational Data Mining. Springer- Verlag, Berlin.
12. Getoor, L. 2003. Link mining: A new data mining challenge. SIGKDD Explorations 5(1) 84-89.
13. Getoor, L., M. Sahami. 1999. Using probabilistic relational models for collaborative filtering. Proc. WebKDD'99, San Diego.
14. Getoor, L., N. Friedman, D. Koller, B. Taskar. 2002. Learning probabilistic models of link structure. J. Machine Learn. Res. 3 679-707.
15. Gilbert, P. D. 1995. Combining VAR estimation and state space model reduction for simple good predictions. J. Forecasting 14 229-250.
16. Goldberg, D. S., F. P. Roth. 2003. Assessing experimentally derived interactions in a small world. Proc. National Acad. Sci. 100(8) 4372-4376.
17. Heider, F. 1946. Attitudes and cognitive organization. J. Psych. 21 107-112.
18. Hofmann, T. 1999. Probabilistic latent semantic analysis. K. Laskey, H. Prade, eds. Proc. 15th Conf. Uncertainty Artificial Intelligence, Stockholm, Morgan Kaufmann, San Fransisco, 289-296.
19. Hofmann, T. 2004. Latent semantic models for collaborative filtering. ACM Trans. Inform. Systems 22(1) 89-115.
20. Holme, P., S. M. Park, B. J. Kim, C. R. Edling. 2007. Korean university life in a network perspective: Dynamics of a large affiliation network. Physica A 373 821-830.
21. Huang, Z., H. Chen, D. Zeng. 2004a. Applying associative retrieval techniques to alleviate the sparsity problem in collaborative filtering. ACM Trans. Inform. Systems 22(1) 116-142.
22. Huang, Z., D. Zeng, H. Chen. 2004b. A link analysis approach to recommendation with sparse data. Proc. Americas Conf. Inform. Systems, New York, Association of Information Systems, Atlanta, 1997-2005.
23. Huang, Z., W. Chung, T.-H. Ong, H. Chen. 2002. A graphbased recommender system for digital library. Proc. Second ACM/IEEE-CS Joint Conf. Digital Libraries, Portland, OR, ACM, New York, Association of Information Systems, Atlanta, 65-73.
24. Katz, L. 1953. A new status index derived from sociometric analysis. Psychometrika 18(1) 39-43.
25. Leskovec, J., J. Kleinberg, C. Faloutsos. 2007. Graph evolution: Densification and shrinking diameters. ACM Trans. Knowledge Discovery Data 1(1) 2.
26. Liben-Nowell, D., J. Kleinberg. 2003. The link prediction problem for social networks. Proc. 12th Internat. Conf. Inform. Knowledge Management (CIKM), New Orleans, ACM, New York, 556-559.
27. O'Madadhain, J., J. Hutchins, P. Smyth. 2005. Prediction and ranking algorithms for event-based network data. ACM SIGKDD Explorations 7(2) 23-30.
28. Popescul, A., L. Ungar. 2003. Statistical relational learning for link prediction. Proc. Workshop Learn. Statist. Models Relational Data Internat. Joint Conf. Artificial Intelligence, Acapulco, Mexico, ACM, New York, 81-90.
29. Porter-Hudak, S. 1990. An application of the seasonal fractionally differenced model to the monetary aggregates. J. Amer. Statist. Assoc. 85(410) 338-344.
30. Potgieter, A., K. A. April, R. J. E. Cooke, I. O. Osunmakinde. 2009. Temporality in link prediction: Understanding social complexity. Emergence Complexity Organ. Forthcoming.
31. Rattigan, M., D. Jensen. 2005. The case for anomalous link detection. Proc. 4th Multi-Relational Data Mining Workshop, 11th ACM SIGKDD Internat. Conf. Knowledge Discovery and Data Mining, Chicago, ACM, New York, 69-74.
32. Resnick, P., H. Varian. 1997. Recommender systems. Comm. ACM 40(3) 56-58.
33. Resnick, P., N. Iacovou, M. Suchak, P. Bergstorm, J. Riedl. 1994. GroupLens: An open architecture for collaborative filtering of netnews. Proc. ACM Conf. Comput.-Supported Cooperative Work, ACM, New York, 175-186.
34. Salton, G. 1989. Automatic Text Processing: The Transformation, Analysis, and Retrieval ofInf ormation by Computer. Addison Wesley, Reading, MA.
35. Sarkar, P., A. W. Moore. 2005. Dynamic social network analysis using latent space models. ACM SIGKDD Explorations 7(2) 31-40.
36. Sarwar, B., G. Karypis, J. Konstan, J. Riedl. 2000. Application of dimensionality reduction in recommender systems: A case study. Proc. WebKDD Workshop at the ACM SIGKKD, Boston, ACM, New York.
37. Shetty, J., J. Adibi. 2005. The Enron data set database schema and brief statistical report, http://www.isi.edu/∼adibi/Enron/Enron-Dataset-Report. pdf.
38. Shumway, R., D. S. Stofer. 2000. Time Series Analysis and Its Applications. Springer-Verlag, New York.
39. Ungar, L. H., D. P. Foster. 1998. A formal statistical approach to collaborative filtering. Proc. Conf. Automated Learn. Discovery (CONALD), Pittsburgh.
40. Vazquez, A., J. G. Oliveira, A.-L. Barabasi. 2005. The inhomogeneous evolution of subgraphs and cycles in complex networks. Phys. Rev. Lett. E 71 025103.
41. Winkler, W. E. 1994. Advanced methods for record linkage. Technical report, Statistical Research Division, U.S. Census Bureau, Wasington, D.C.
42. Yu, K., W. Chu, S. Yu, V. Tresp, Z. Xu. 2006. Stochastic relational models for discriminative link prediction. Adv. Neural Inform. Processing Systems 19 1553-1560.