%0 Generic %1 citeulike:277410 %A Kubica, J. %A Moore, A. %A Cohn, D. %A Schneider, J. %D 2003 %K web-graph %T cgraph: A fast graph-based method for link analysis and queries %U http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.7750 %X Many techniques in the social sciences and graph theory deal with the problem of examining and analyzing patterns found in the underlying structure and associations of a group of entities. However, much of this work assumes that this underlying structure is known or can easily be inferred from data, which may often be an unrealistic assumption for many real-world problems. Below we consider the problem of learning and querying a graph-based model of this underlying structure.

@misc{citeulike:277410, abstract = {Many techniques in the social sciences and graph theory deal with the problem of examining and analyzing patterns found in the underlying structure and associations of a group of entities. However, much of this work assumes that this underlying structure is known or can easily be inferred from data, which may often be an unrealistic assumption for many real-world problems. Below we consider the problem of learning and querying a graph-based model of this underlying structure.}, added-at = {2009-08-06T15:16:38.000+0200}, author = {Kubica, J. and Moore, A. and Cohn, D. and Schneider, J.}, biburl = {https://www.bibsonomy.org/bibtex/2c1d561f458e66d69c32b7c58f2013e10/chato}, citeulike-article-id = {277410}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.7750}, interhash = {f742548eb9200fc5774dc6ea8f4c7c22}, intrahash = {c1d561f458e66d69c32b7c58f2013e10}, keywords = {web-graph}, posted-at = {2005-08-09 16:56:18}, priority = {0}, timestamp = {2009-08-06T15:16:55.000+0200}, title = {cgraph: A fast graph-based method for link analysis and queries}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.7750}, year = 2003 }