<Record><identifier xmlns="http://purl.org/dc/elements/1.1/">URN:NBN:SI:DOC-C1P7AMCE</identifier><date>2015</date><creator>Fang, Gang</creator><relation>documents/doc/C/URN_NBN_SI_doc-C1P7AMCE_001.pdf</relation><relation>documents/doc/C/URN_NBN_SI_doc-C1P7AMCE_001.txt</relation><format format_type="issue">1</format><format format_type="volume">39</format><format format_type="type">article</format><format format_type="extent">str. 87-98</format><identifier identifier_type="ISSN">0350-5596</identifier><identifier identifier_type="COBISSID">29222951</identifier><identifier identifier_type="URN">URN:NBN:SI:doc-C1P7AMCE</identifier><language>eng</language><publisher>Slovensko društvo Informatika</publisher><source>Informatica (Ljubljana)</source><rights>InC</rights><subject language_type_id="slv">algoritmi</subject><subject language_type_id="slv">asociativno učenje</subject><subject language_type_id="slv">informatika</subject><subject language_type_id="eng">information science</subject><subject language_type_id="slv">podatkovno rudarjenje</subject><title>An efficient algorithm for mining frequent closed itemsets</title></Record>