
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Michel L. Goldstein, Gary G. Yen, "Using Evolutionary Algorithms for Defining the Sampling Policy of Complex NPartite Networks," IEEE Transactions on Knowledge and Data Engineering, vol. 17, no. 6, pp. 762773, June, 2005.  
BibTex  x  
@article{ 10.1109/TKDE.2005.100, author = {Michel L. Goldstein and Gary G. Yen}, title = {Using Evolutionary Algorithms for Defining the Sampling Policy of Complex NPartite Networks}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {17}, number = {6}, issn = {10414347}, year = {2005}, pages = {762773}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2005.100}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  Using Evolutionary Algorithms for Defining the Sampling Policy of Complex NPartite Networks IS  6 SN  10414347 SP762 EP773 EPD  762773 A1  Michel L. Goldstein, A1  Gary G. Yen, PY  2005 KW  Npartite network KW  evolutionary algorithm KW  graphicstructured database. VL  17 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] M.L. Goldstein, S.A. Morris, and G.G. Yen, “Bridging the Gap between Data Acquisition and Inference Ontologies— Towards Ontology Based Link Discovery,” Proc. AeroSense— Sensors, and Command, Control, Comm., and Intelligence (C3I) Technologies for Homeland Defense and Law Enforcement II (OR25), pp. 116127, 2003.
[2] M.L. Goldstein and G.G. Yen, “An Evolutionary Algorithm Method for Sampling nPartite Graphs,” Proc. Congress Evolutionary Computation, pp. 22502257, 2004.
[3] J. Gonzalez, I. Jonyer, L.B. Holder, and D.J. Cook, “Efficient Mining of GraphBased Data,” Proc. AAAI Workshop Learning Statistical Models from Relational Data, pp. 2128, 2000.
[4] D.J. Cook and L.B. Holder, “Scalable Discovery of Informative Structural Concepts Using Domain Knowledge,” IEEE Expert, vol. 11, pp. 5968, 1996.
[5] H. Toivonen, “Sampling Large Databases for Association Rules,” Proc. Very Large Databases Conf., pp. 134145, 1996.
[6] D. Madigan and M. Nason, “Data Reduction: Sampling,” Handbook of Data Mining and Knowledge Discovery, pp. 205208, New York: Oxford Univ. Press, 2002.
[7] J.S. Park, P.S. Yu, and M.S. Chen, “Mining Association Rules with Adjustable Accuracy,” Proc. Sixth Int'l Conf. Information and Knowledge Management, pp. 151160, 1997.
[8] O. Frank, “Sampling and Estimation in Large Social Networks,” Social Networks, vol. 1, pp. 91101, 1978.
[9] E. Costenbader and T.W. Valentine, “The Stability of Centrality Measures When Networks are Sampled,” Social Networks, vol. 25, pp. 283307, 2003.
[10] S. Djoko, D.J. Cook, and L.B. Holder, “An Empirical Study of Domain Knowledge and Its Benefits to Substructure Discovery,” IEEE Trans. Knowledge and Data Eng., vol. 9, pp. 575586, 1997.
[11] R.H. Güting, “GraphDB: Modeling and Querying Graphs in Databases,” Proc. 20th Int'l Conf. Very Large Databases, pp. 297308, 1994.
[12] S. Nestorov, J.D. Ullman, J.L. Wiener, and S.S. Chawathe, “Representative Objects: Concise Representation of Semistructured, Hierarchical Data,” Proc. Int'l Conf. Data Eng., pp. 7990, 1997.
[13] T. Milo and D. Suciu, “Index Structures for Path Expressions,” Proc. Int'l Conf. Database Theory, pp. 277295, 1999.
[14] D. Shasha, J.T.L. Wang, and R. Giugno, “Algorithmics and Applications of Tree and Graph Searching,” Proc. Symp. Principles of Database Systems, pp. 3952, 2002.
[15] H.D. White and K.W. Mccain, “Bibliometrics,” Ann. Rev. Information Science and Technology, vol. 24, pp. 119186, 1989.
[16] R.C. Gonzalez and M.G. Thomason, Syntactic Pattern Recongnition. Reading, Mass.: AddisonWesley Publishing, 1978.
[17] R. Albert and A.L. Barabási, “Statistical Mechanics of Complex Networks,” Rev. Modern Physics, vol. 74, pp. 4797, 2002.
[18] M.E.J. Newman, “The Structure and Function of Complex Networks,” SIAM Rev., vol. 45, pp. 157256, 2003.
[19] S.N. Dorogovtsev and J.F.F. Mendes, “Evolution of Networks,” Advances in Physics, vol. 51, pp. 10791187, 2002.
[20] G. Caldarelli, “Introduction to Complex Networks,” Proc. Seventh Conf. Statistical and Computational Physics, pp. 1723, 2002.
[21] M.L. Goldstein, S.A. Morris, and G.G. Yen, “Problems with Fitting to the PowerLaw Distribution,” European Physical J. B, vol. 41, pp. 255258, 2004.
[22] N.L. Johnson, S. Kotz, and A.W. Kemp, Univariate Discrete Distributions, second ed. New York: John Wiley & Sons, 1992.
[23] P. Erdös and A. Rényi, “On Random Graphs,” Publications Mathematicae, vol. 6, pp. 290297, 1959.
[24] M.L. Goldstein, S.A. Morris, and G.G. Yen, “GroupBased Yule Model for Bipartite AuthorPaper Networks,” Physical Rev. E, vol. 71, 2005, to appear.
[25] W.J. Conover, Practical Nonparametric Statistics, third ed. New York: Wiley, 1999.
[26] D.E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning. Reading, Mass.: AddisonWesley, 1989.
[27] J.H. Holland, Adaptation in Natural and Artificial Systems. Ann Arbor, Mich.: The Univ. of Michigan Press, 1975.
[28] C. Dwork, R. Kumar, N. Naor, and D. Sivakumar, “Rank Aggregation Methods for the Web,” Proc. 10th Int'l World Wide Web Conf., pp. 613622, 2001.
[29] F. Olken and D. Rotem, “Random Sampling from Databases: A Survey,” Statistics and Computing, vol. 51, pp. 2542, 1995.