{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,29]],"date-time":"2024-01-29T15:38:03Z","timestamp":1706542683036},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,9,9]],"date-time":"2005-09-09T00:00:00Z","timestamp":1126224000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2006,7]]},"DOI":"10.1007\/s10115-005-0229-2","type":"journal-article","created":{"date-parts":[[2005,9,8]],"date-time":"2005-09-08T15:04:09Z","timestamp":1126191849000},"page":"57-91","source":"Crossref","is-referenced-by-count":3,"title":["Exploiting edge semantics in citation graphs using efficient, vertical ARM"],"prefix":"10.1007","volume":"10","author":[{"given":"Imad","family":"Rahal","sequence":"first","affiliation":[]},{"given":"Dongmei","family":"Ren","sequence":"additional","affiliation":[]},{"given":"Weihua","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Anne","family":"Denton","sequence":"additional","affiliation":[]},{"given":"Christopher","family":"Besemann","sequence":"additional","affiliation":[]},{"given":"William","family":"Perrizo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,9,9]]},"reference":[{"key":"229_CR1","unstructured":"Agrawal R, Imielinski T, Swami A (1993) Mining associations between sets of items in massive databases. In: Buneman P, Jajodia S (eds) Proceedings of the ACM SIGMOD international conference on management of data, May 1993. Washington, DC, USA. ACM Press, pp 207\u2013216"},{"key":"229_CR2","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Bocca JB, Jarke M, Zaniolo C (eds) Proceedings of the 20th VLDB international conference on very large databases, September 1994. Morgan Kaufmann, Santiago, Chile, pp 487\u2013499"},{"key":"229_CR3","unstructured":"Akutsu T, Miyano S, Kuhara S (1999) Identification of genetic networks from a small number of gene expression patterns under the Boolean network model. In: Proceedings of the PSB Pacific symposium on biocomputing. Hawaii, USA, January 1999, pp 17\u201328"},{"key":"229_CR4","unstructured":"AIP (2004) American Institute of Physics. http:\/\/www.aip.org , 24 June 2004"},{"key":"229_CR5","unstructured":"Borgelt C (2003) Efficient implementations of Apriori and ECLAT. In: Geothals B, Zaki M (eds) CEUR workshop proceedings of the IEEE ICDM 1st FIMI international workshop frequent itemset mining implementations, 6 June 2004. http:\/\/sunsite.informatik.rwth-aachen.de\/Publications\/CEUR-WS\/\/Vol-90\/"},{"issue":"1","key":"229_CR6","first-page":"262","volume":"97","author":"M Brown","year":"2000","unstructured":"Brown M, Grundy WN, Lin D et al (2000) Knowledge-based analysis of microarray gene expression data by using support vector machines. Genetics 97(1):262\u2013267","journal-title":"Genetics"},{"issue":"8","key":"229_CR7","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1109\/2.781636","volume":"32","author":"S Chakrabarti","year":"1999","unstructured":"Chakrabarti S, Dom BE, Gibson D et al (1999) Mining the link structure of the World Wide Web. IEEE Comput 32(8):60\u201367","journal-title":"IEEE Comput"},{"key":"229_CR8","doi-asserted-by":"crossref","unstructured":"Ding Q, Ding Qi, Perrizo W (2002a) Association rule mining on remotely sensed images using P-trees. In: Cheng MS, Yu PS, Liu B (eds) Proceedings of the 6th PAKDD Pacific-Asian conference on knowledge discovery and data mining, Taipei, Taiwan, May 2002. Lecture notes in computer science 2336. Springer-Verlag, Berlin Heidelberg New York, pp 66\u201379","DOI":"10.1007\/3-540-47887-6_7"},{"key":"229_CR9","doi-asserted-by":"crossref","unstructured":"Ding Q, Khan M, Roy A et al (2002b) The P-tree algebra. In: Panda B (ed) Proceedings of the 17th ACM SAC symposium on applied computing, Madrid, Spain, March 2002. ACM Press, pp 413\u2013417","DOI":"10.1145\/508791.508872"},{"key":"229_CR10","volume-title":"Introduction to informetrics: quantitative methods in library, documentation and information science","author":"L Egghe","year":"1990","unstructured":"Egghe L, Rousseau R (1990) Introduction to informetrics: quantitative methods in library, documentation and information science. Elsevier, Amsterdam"},{"key":"229_CR11","unstructured":"FIMI (2003) Frequent Itemset Mining Implementations Repository. http:\/\/fimi.cs.helsinki.fi , 1 June 2004"},{"key":"229_CR12","unstructured":"Geurts K, Wets G, Brijs T et al (2003) Profiling high frequency accident locations using association rules. In: Proceedings of the 82nd TRB annual meeting of the transportation tesearch board. Washington, DC, USA, January 2003, p 18"},{"issue":"1\u20133","key":"229_CR13","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0166-218X(94)90211-9","volume":"49","author":"F Glover","year":"1994","unstructured":"Glover F (1994) Tabu search for nonlinear and parametric optimization (with links to genetic algorithms). Discrete Appl Math 49(1\u20133):231\u2013255","journal-title":"Discrete Appl Math"},{"key":"229_CR14","unstructured":"Goethals B (2002) Personal Website. http:\/\/www.adrem.ua.ac.be\/~goethals\/ , 2 March 2004"},{"key":"229_CR15","unstructured":"Goethals B (2003) Survey on frequent pattern mining. http:\/\/www.adrem.ua.ac.be\/~goethals\/ , 30 December 2004"},{"key":"229_CR16","doi-asserted-by":"crossref","unstructured":"Goethals B (2004) Memory issues in frequent itemset mining. In: Haddad H, Omicini A, Wainwright RL, Liebrock LM (eds) Proceeding of the 19th ACM SAC symposium on applied computing. Nicosia, Cyprus, March 2004. ACM Press, pp 530\u2013534","DOI":"10.1145\/967900.968012"},{"key":"229_CR17","doi-asserted-by":"crossref","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In: Chen W, Naughton JF, Bernstein PA (eds) Proceedings of the ACM SIGMOD international conference on management of data, Dallas, Texas, USA, June 2002. ACM Press, pp 1\u201312","DOI":"10.1145\/342009.335372"},{"key":"229_CR18","volume-title":"The nature and logic of capitalism","author":"RL Heilbroner","year":"1986","unstructured":"Heilbroner RL, Galbraith JK (1986) The nature and logic of capitalism. W.W. Norton and Company, New York"},{"key":"229_CR19","unstructured":"IBM (2004) IBM Quest Synthetic Data Generator. http:\/\/www.almaden.ibm.com\/software\/quest\/Resources\/datasets\/syndata.html , 7 April 2004"},{"key":"229_CR20","doi-asserted-by":"crossref","unstructured":"Inokuchi A, Washio T, Motoda H (2000) An Apriori-based algorithm for mining frequent substructures from graph data. In: Zighed DA, Komorowski HJ, Zytkow JM (eds) Proceedings of the PKDD European conference on principles and practice of knowledge discovery in databases, Lyon, France, September 2000. Lecture notes in computer science 1910. Springer, Berlin Heidelberg New York, pp 13\u201323","DOI":"10.1007\/3-540-45372-5_2"},{"key":"229_CR21","unstructured":"KDD Cup Competition (2003) The 9th ACM SIGKDD CUP international conference on knowledge discovery and data mining. http:\/\/www.cs.cornell.edu\/projects\/kddcup , 30 December 2004"},{"key":"229_CR22","unstructured":"Khan M, Ding Q, Perrizo W (2002) textitk-nearest neighbor classification on spatial data streams using P-trees. In: Cheng MS, Yu PS, Liu B (eds) Proceedings of the 6th PAKDD Pacific-Asian conference on knowledge discovery and data mining. Taipei, Taiwan, May 2002. Lecture notes in computer science 2336. Springer, pp 517\u2013518"},{"key":"229_CR23","unstructured":"Kleinberg JM (1998) Authoritative sources in a hyperlinked environment. In: Proceedings of the ACM-SIAM SODA symposium on discrete algorithms. San Francisco, California, USA, January 1998, pp 668\u2013677"},{"key":"229_CR24","unstructured":"Kosters WA, Pijls W (2003) APRIORI, a depth first implementation. In: Geothals B, Zaki M (eds) CEUR workshop proceedings of the IEEE ICDM 1st FIMI international workshop frequent itemset mining implementations. http:\/\/sunsite.informatik.rwth-aachen.de\/Publications\/CEUR-WS\/\/Vol-90\/ , 6 June 2004"},{"key":"229_CR25","first-page":"integrating","volume":"mining","author":"Kostoff","year":"2001","unstructured":"Kostoff RN, Del Rio JA, Humenik JA, et al (2001) Citation mining: integrating text mining and bibliometrics for research user profiling. J Am Soc Inform Sci Technol 52(13)","journal-title":"Citation"},{"key":"229_CR26","doi-asserted-by":"crossref","unstructured":"Kuramochi M, Karypis G (2002) An efficient algorithm for discovering frequent subgraphs. Technical Report 02-026, University of Minnesota, Department of Computer Science, http:\/\/www.users.cs.umn.edu\/~karypis\/publications\/Papers\/PDF\/fsg2.pdf , 20 February 2004","DOI":"10.21236\/ADA439497"},{"key":"229_CR27","first-page":"622","volume-title":"Simulation modeling and analysis","author":"A Law","year":"2000","unstructured":"Law A, Kelton W (2000) Experimental design, sensitivity analysis, and optimization. In: Simulation modeling and analysis. McGraw-Hill, Singapore, pp 622\u2013668"},{"key":"229_CR28","unstructured":"Liu B, Hsu W (1996) Post-analysis of learned rules. In: Proceedings of the AAAI national conference on artificial intelligence. Portland, Oregon, USA, August 1996. AAAI Press\/MIT Press, pp 828\u2013834"},{"key":"229_CR29","doi-asserted-by":"crossref","unstructured":"Matsuda T, Motoda H, Yoshida T et al (2002) Mining patterns from structured data by beam-wise graph-based induction. In: Lange S, Satoh K, Smith CH (eds) Proceedings of the 5th DS international conference on discovery science. London, UK, November 2002. Lecture notes in computer science 2534, pp 422\u2013429","DOI":"10.1007\/3-540-36182-0_44"},{"issue":"4","key":"229_CR30","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1515\/libr.1996.46.4.217","volume":"46","author":"F Osareh","year":"1996","unstructured":"Osareh F (1996) Bibliometrics, citation analysis and co-citation analysis: a review of literature I. Libri 46(4):149\u2013158","journal-title":"Libri"},{"key":"229_CR31","first-page":"358","volume":"11","author":"T Oyama","year":"2000","unstructured":"Oyama T, Kitano K, Satou K, et al (2000) Mining association rules related to protein\u2013protein interactions. Genome Inform 11:358\u2013359","journal-title":"Genome Inform"},{"key":"229_CR32","doi-asserted-by":"crossref","unstructured":"Padmanabhan B, Tuzhilin A (1999) Unexpectedness as a measure of interestingness in knowledge discovery. Decision Support Syst 27(3)","DOI":"10.1016\/S0167-9236(99)00053-6"},{"key":"229_CR33","doi-asserted-by":"crossref","unstructured":"Parthasarathy S, Coatney M (2002) Efficient discovery of common substructures in macromolecules. In: Proceedings of the 2nd IEEE ICDM international conference on data mining. IEEE Computer Society 2002. Maebashi City, Japan, December 2002, pp 362\u2013369","DOI":"10.1109\/ICDM.2002.1183924"},{"key":"229_CR34","unstructured":"Perrizo W (2001) Peano count tree technology lab notes. Technical Report NDSU-CS-TR-01, North Dakota State University, Computer Science Department, http:\/\/www.cs.ndsu.nodak.edu\/~perrizo\/classes\/785\/pct.html , 18 January 2003"},{"key":"229_CR35","doi-asserted-by":"crossref","unstructured":"Perrizo W, Ding Q, Denton A et al (2003) PINE\u2013-podium incremental neighbor evaluator for spatial data using ptrees. In: Proceedings of the ACM SAC symposium on applied computing. Melbourne, Florida, USA, March 2003. ACM Press, pp 503\u2013508","DOI":"10.1145\/952532.952633"},{"key":"229_CR36","doi-asserted-by":"crossref","unstructured":"Perrizo W, Ding Q, Roy A (2001) Deriving high confidence rules from spatial data using peano count trees. In: Wang WS, Yu G, Lu H (eds) Proceedings of the WAIM international conference on web-page information management, Xi'an, China. Lecture notes in computer science 2118. Springer, Berlin Heidelberg New York, pp 91\u2013102.","DOI":"10.1007\/3-540-47714-4_9"},{"key":"229_CR37","unstructured":"Pietracaprina A, Zandolin D (2003) Mining frequent itemsets using patricia tries. In: Geothals B, Zaki M (eds) CEUR workshop proceedings of the IEEE ICDM 1st FIMI international workshop on frequent itemset mining implementations. http:\/\/sunsite.informatik.rwth-aachen.de\/Publications\/CEUR-WS\/\/Vol-90\/ , 6 June 2004"},{"key":"229_CR38","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1093\/bioinformatics\/18.suppl_2.S182","volume":"18","author":"P Pipenbacker","year":"2002","unstructured":"Pipenbacker P, Schliep A, Schneckener S et al (2002) ProClust: improved clustering of protein sequences with an extended graph-based approach. Bioinformatics 18:182\u2013191","journal-title":"Bioinformatics"},{"key":"229_CR39","unstructured":"Pray L (2003) Unraveling protein\u2013protein interactions. Scientist 17(2). http:\/\/www.the-scientist.com\/yr2003\/jan\/lcprofile1_030127.html , 30 December 2004"},{"key":"229_CR40","doi-asserted-by":"crossref","unstructured":"Rahal I, Perrizo W (2004) An optimized approach for knn text categorization using p-trees. In: Haddad H, Omicini A, Wainwright RL, Liebrock LM (eds) Proceedings of the 19th ACM SAC symposium on applied computing. Nicosia, Cyprus, March 2004. ACM Press, pp 613\u2013617","DOI":"10.1145\/967900.968026"},{"key":"229_CR41","doi-asserted-by":"crossref","unstructured":"Serazi M, Perera A, Ding Q, et al (2004) DataMIME\u2122. In: Weikum G, K\u00f6nig AC, De\u00dfloch S (eds) Proceedings of the ACM SIGMOD international conference on management of data. Paris, France, June 2004. ACM Press, pp 923\u2013924","DOI":"10.1145\/1007568.1007697"},{"key":"229_CR42","doi-asserted-by":"crossref","unstructured":"Shenoy P, Haristsa JR, Sudatsham S. et al (2000) Turbo-charging vertical mining of large databases. In: Chen W, Naughton JF, Bernstein PA (eds) Proceedings of the ACM SIGMOD international conference on management of data. Dallas, Texas, USA, May 2000. ACM Press, pp 22\u201329","DOI":"10.1145\/342009.335376"},{"key":"229_CR43","unstructured":"Silberschatz A, Tuzhilin A (1995) On subjective measures of interestingness in knowledge discovery. In: Fayyad U, Uthurusamy R (eds) Proceedings of the 1st ACM SIGKDD international conference on knowledge discovery and data mining. Montreal, Canada, August 1995. AAAI Press, pp 275\u2013281"},{"issue":"6","key":"229_CR44","doi-asserted-by":"crossref","first-page":"970","DOI":"10.1109\/69.553165","volume":"8","author":"A Silberschatz","year":"1996","unstructured":"Silberschatz A, Tuzhilin A (1996) What makes patterns interesting in knowledge discovery systems. Special issue on data mining. IEEE TKDE Trans Knowledge Data Eng 8(6):970\u2013974","journal-title":"IEEE TKDE Trans Knowledge Data Eng"},{"key":"229_CR45","unstructured":"Suzuki E (1997) Autonomous discovery of reliable exception rules. In: Heckerman D, Mannila H, Pregibon D (eds) Proceedings of the 3rd ACM SIGKDD international conference on knowledge discovery and data mining. Newport Beach, California, USA, August 1997. AAAI Press, pp 259\u2013262"},{"key":"229_CR46","unstructured":"TouchGraph LLC (2001) http:\/\/www.touchgraph.com [24 November 2004]"},{"key":"229_CR47","unstructured":"UCI (1998) University of California Irvine data repository. http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html [30 December 2004]"},{"key":"229_CR48","doi-asserted-by":"crossref","unstructured":"Wang B, Pan F, Ren D et al (2003) Efficient olap operations for spatial using Peano trees. In: Zaki M, Aggrawal C (eds) Proceedings of the ACM SIGMOD DMKD workshop on data mining and knowledge discovery. San Diego, California, USA, June 2003. ACM Press, pp 28\u201334","DOI":"10.1145\/882082.882090"},{"key":"229_CR49","unstructured":"Yahoo! Inc. (2005). http:\/\/www.yahoo.com [10 February 2005]"},{"key":"229_CR50","unstructured":"Yan X, Han J (2002) gSpan: graph-based substructure pattern mining. In: Proceedings of the IEEE ICDM international conference on data mining. Maebashi City, Japan, December 2002. IEEE Computer Society, pp 721\u2013724"},{"key":"229_CR51","doi-asserted-by":"crossref","unstructured":"Zaki M, Gouda K (2003) Fast vertical mining using diffsets. In: Getoor L, Senator TE, Domingos P, Faloutsos C (eds) Proceedings of the 9th ACM SIGKDD international conference on knowledge discovery and data mining. Washington, DC, USA, August 2003. ACM Press, pp 326\u2013335","DOI":"10.1145\/956750.956788"},{"key":"229_CR52","unstructured":"Zaki M, Parthasarathy S, Ogihara M, et al (1997) New algorithms for fast discovery of association rules. In: Heckerman D, Mannila H, Pregibon D (eds). Proceedings of the 3rd ACM SIGKDD international conference on knowledge discovery and data mining. Newport Beach, California, USA, August 1997. AAAI Press, pp 283\u2013286"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-005-0229-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-005-0229-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-005-0229-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,29]],"date-time":"2024-01-29T14:28:49Z","timestamp":1706538529000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-005-0229-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,9,9]]},"references-count":52,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,7]]}},"alternative-id":["229"],"URL":"https:\/\/doi.org\/10.1007\/s10115-005-0229-2","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,9,9]]}}}