<?xml version="1.0"?>
<dblp>
<inproceedings key="conf/edbt/LinK98" mdate="2009-09-23">
<ee>http://dx.doi.org/10.1007/BFb0100972</ee>
<author>Dao-I Lin</author>
<author>Zvi M. Kedem</author>
<title>Pincer Search: A New Algorithm for Discovering the Maximum Frequent Set.</title>
<pages>105-119</pages>
<cdrom>EDBT/1998/13770105.pdf</cdrom>
<ee>http://link.springer.de/link/service/series/0558/bibs/1377/13770105.htm</ee>
<year>1998</year>
<crossref>conf/edbt/98</crossref>
<booktitle>EDBT</booktitle>
<url>db/conf/edbt/edbt98.html#LinK98</url>
<cite>conf/sigmod/AgrawalIS93</cite>
<cite>conf/vldb/AgrawalS94</cite>
<cite>journals/tkde/AgrawalS96</cite>
<cite>conf/sigmod/BrinMUT97</cite>
<cite>books/mit/FayyadPSU96</cite>
<cite>conf/icdt/GunopoulosMS97</cite>
<cite>conf/vldb/HanF95</cite>
<cite>...</cite>
<cite>conf/kdd/MannilaTV95</cite>
<cite>journals/datamine/MannilaT97</cite>
<cite>...</cite>
<cite>journals/ai/Mitchell82</cite>
<cite>conf/icde/OzdenRS98</cite>
<cite>conf/sigmod/ParkCY95</cite>
<cite>books/mit/PF91/Piatetsky91</cite>
<cite>conf/vldb/SavasereON95</cite>
<cite>conf/vldb/SrikantA95</cite>
<cite>conf/vldb/Toivonen96</cite>
<cite>conf/kdd/ZakiPOL97</cite>
</inproceedings>
</dblp>
