PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Soulet, Arnaud"

Author of the publication

copydeleteadd this publication to your clipboard
Mining Significant Maximum Cardinalities in Knowledge Bases.

, , and . ISWC (1), volume 11778 of Lecture Notes in Computer Science, page 182-199. Springer, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Soulet, Arnaud
add a person with the name Soulet, Arnaud
 

Other publications of authors with the same name

Mining constraint-based patterns using automatic relaxation., and . Intell. Data Anal., 13 (1): 109-133 (2009)Average Number of Frequent and Closed Patterns in Random Databases., , and . CAP, page 345-360. PUG, (2005)Contextual preference mining for user profile construction., , , , , and . Inf. Syst., (2015)Condensed Representation of EPs and Patterns Quantified by Frequency-Based Measures., , and . KDID, volume 3377 of Lecture Notes in Computer Science, page 173-190. Springer, (2004)A Relational View of Pattern Discovery., , and . DASFAA (1), volume 6587 of Lecture Notes in Computer Science, page 153-167. Springer, (2011)Mining Significant Maximum Cardinalities in Knowledge Bases., , and . ISWC (1), volume 11778 of Lecture Notes in Computer Science, page 182-199. Springer, (2019)Interactive Pattern Sampling for Characterizing Unlabeled Data., and . IDA, volume 10584 of Lecture Notes in Computer Science, page 99-111. Springer, (2017)Frequent Pattern Outlier Detection Without Exhaustive Mining., and . PAKDD (2), volume 9652 of Lecture Notes in Computer Science, page 196-207. Springer, (2016)Efficiently Depth-First Minimal Pattern Mining., and . PAKDD (1), volume 8443 of Lecture Notes in Computer Science, page 28-39. Springer, (2014)Extraction des Top-k Motifs par Approximer-et-Pousser., and . EGC, volume RNTI-E-9 of Revue des Nouvelles Technologies de l'Information, page 271-282. Cépaduès-Éditions, (2007)