FS3: A sampling based method for top‐k frequent subgraph mining

Publisher： John Wiley & Sons Inc

E-ISSN： 1932-1872|8|4|245-261

ISSN： 1932-1864

Source： STATISTICAL ANALYSIS AND DATA MINING (ELECTRONIC), Vol.8, Iss.4, 2015-08, pp. : 245-261

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Hardness of k-Vertex-Connected Subgraph Augmentation Problem

By Ma Changcun   Kim Donghyun   Wang Yuexuan   Wang Wei   Sohaee Nassim   Wu Weili  

Journal of Combinatorial Optimization, Vol. 20, Iss. 3, 2010-10 ,pp. : 249-258

Springer Publishing Company

Access to resources Recommend Favorite

A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph

By Auletta V.   Dinitz Y.   Nutov Z.   Parente D.  

Journal of Algorithms, Vol. 32, Iss. 1, 1999-07 ,pp. : 21-30

Academic Press

Access to resources Recommend Favorite

Multiple Criteria in a Top Gas Recycling Blast Furnace Optimized through a k‐Optimality‐Based Genetic Algorithm

By  

STEEL RESEARCH INTERNATIONAL, Vol. 87, Iss. 10, 2016-10 ,pp. : 1284-1294

John Wiley & Sons Inc

Access to resources Recommend Favorite

A Better Approximation Ratio for the Minimum Size k-Edge-Connected Spanning Subgraph Problem

By Fernandes C.G.  

Journal of Algorithms, Vol. 28, Iss. 1, 1998-07 ,pp. : 105-124

Academic Press

Access to resources Recommend Favorite

Electrooptical sampling of ultra-short THz pulses by fs-laser pulses at 1060 nm

By Pradarutti B.   Matthäus G.   Brückner C.   Limpert J.   Riehemann S.   Notni G.   Nolte S.   Tünnermann A.  

Applied Physics B, Vol. 85, Iss. 1, 2006-10 ,pp. : 59-62

Springer Publishing Company

Access to resources Recommend Favorite