Title
A tight upper bound on the number of candidate patterns A tight upper bound on the number of candidate patterns
Author
Faculty/Department
Faculty of Sciences. Mathematics and Computer Science
Publication type
conferenceObject
Publication
s.l. :IEEE Computer Society Press, [*]
Source (book)
Proceedings of the IEEE International Conference on Data Mining
ISI
000173158200020
Carrier
E
Target language
English (eng)
Full text (Publishers DOI)
E-info
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000173158200020&DestLinkType=RelatedRecords&DestApp=ALL_WOS&UsrCustomerID=ef845e08c439e550330acc77c7d2d848
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000173158200020&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=ef845e08c439e550330acc77c7d2d848
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000173158200020&DestLinkType=CitingArticles&DestApp=ALL_WOS&UsrCustomerID=ef845e08c439e550330acc77c7d2d848