Search Results - "Jeudy, B."
-
1
Mining free itemsets under constraints
Published in Proceedings 2001 International Database Engineering and Applications Symposium (2001)“…Computing frequent itemsets and their frequencies from large Boolean matrices (e.g., to derive association rules) has been one of the hot topics in data…”
Get full text
Conference Proceeding
-
2
Using the H-Divergence to Prune Probabilistic Automata
Published in 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence (01-11-2011)“…A problem usually encountered in probabilistic automata learning is the difficulty to deal with large training samples and/or wide alphabets. This is partially…”
Get full text
Conference Proceeding