Filters








2,467 Hits in 6.8 sec

Non-redundant Subgroup Discovery Using a Closure System [chapter]

Mario Boley, Henrik Grosskreutz
2009 Lecture Notes in Computer Science  
Subgroup discovery is a local pattern discovery task, in which descriptions of subpopulations of a database are evaluated against some quality function.  ...  These equivalence classes have unique maximal representatives forming a closure system.  ...  In summary we consider the following computational problem: Problem 1 ( non-redundant-subgroup-discovery).  ... 
doi:10.1007/978-3-642-04180-8_29 fatcat:qrenwmuh6bherie7noroi3ofni

Optimal Subgroup Discovery in Purely Numerical Data [chapter]

Alexandre Millot, Rémy Cazabet, Jean-François Boulicaut
2020 Lecture Notes in Computer Science  
Existing methods make use of discretization methods that lead to a loss of information and suboptimal results. This is the case for the reference algorithm SD-Map*.  ...  We consider here the discovery of optimal subgroups according to an interestingness measure in purely numerical data.  ...  Moreover, it would be interesting to investigate how to exploit some sequential covering techniques for computing not only an optimal subgroup but a collection of non-redundant optimal subgroups.  ... 
doi:10.1007/978-3-030-47436-2_9 fatcat:4q6tontjc5dubg7kpuqwoljqy4

Closed Sets for Labeled Data [chapter]

Gemma C. Garriga, Petra Kralj, Nada Lavrač
2006 Lecture Notes in Computer Science  
the number of essential rules in classification, and to efficiently learn subgroup descriptions, as demonstrated in real-life subgroup discovery experiments on a high dimensional microarray data set.  ...  However, their use is mainly descriptive, dealing only with unlabeled data.  ...  Acknowledgments This work was partially funded by the Pascal Network of Excellence through a visit of the first author to the Jožef Stefan Institute, Ljubljana, Slovenia, and the Slovenian Research Agency  ... 
doi:10.1007/11871637_19 fatcat:z4aio3w7mrc7pihtpqu4nj2gmy

Anytime Subgroup Discovery in High Dimensional Numerical Data

Romain Mathonat, Diana Nurbakova, Jean-Francois Boulicaut, Mehdi Kaytoue
2021 2021 IEEE 8th International Conference on Data Science and Advanced Analytics (DSAA)  
Subgroup discovery (SD) enables one to elicit patterns that strongly discriminate a class label.  ...  We finally discuss the actionability of discovered subgroups when looking for skill analysis from Rocket League action logs.  ...  Problem (Non-redundant subgroup set discovery).  ... 
doi:10.1109/dsaa53316.2021.9564223 fatcat:c4edik7xgbakbb545xspwdztfu

Formal Concept Sampling for Counting and Threshold-Free Local Pattern Mining [chapter]

Mario Boley, Thomas Gärtner, Henrik Grosskreutz
2010 Proceedings of the 2010 SIAM International Conference on Data Mining  
Important applications are (a) estimating the number of all formal concepts as well as (b) discovering any number of interesting, non-redundant, and representative local patterns.  ...  Setting (a) can be used for estimating the runtime of algorithms examining all formal concepts.  ...  set mining [4] , or subgroup discovery [6] .  ... 
doi:10.1137/1.9781611972801.16 dblp:conf/sdm/BoleyGG10 fatcat:a3fve6kqfvgydn5xgakl4aqmme

P-N-RMiner: A generic framework for mining interesting structured relational patterns

Jefrey Lijffijt, Eirini Spyropoulou, Bo Kang, Tijl De Bie
2015 2015 IEEE International Conference on Data Science and Advanced Analytics (DSAA)  
We then derive a measure of subjective interestingness of such patterns using Information Theory, and propose an algorithm for effectively enumerating all patterns of this syntax.  ...  Through empirical evaluation, we found that (a) the new interestingness derivation is relevant and cannot be approximated using existing tools, (b) the new tool, P-N-RMiner, finds patterns that are substantially  ...  Exceptional model mining, on the other hand, aims to extend subgroup discovery beyond a single target attribute [15] .  ... 
doi:10.1109/dsaa.2015.7344837 dblp:conf/dsaa/LijffijtSKB15 fatcat:53riefed5rbjtd45jdnhzfod4a

Mining exceptional closed patterns in attributed graphs

Anes Bendimerad, Marc Plantevit, Céline Robardet
2017 Knowledge and Information Systems  
Such data makes possible to identify meaningful city neighborhoods on the basis of the footprints left by a large and diverse population that uses this type of media.  ...  We introduce the novel problem of exceptional subgraph mining in attributed graphs and propose a complete algorithm that takes benefits from closure operators, new upper bounds and pruning properties.  ...  in Subgroup Discovery [14] .  ... 
doi:10.1007/s10115-017-1109-2 fatcat:ogjujeunbzctnajowywb2dyoaa

Recent Workshops of the HUPO Human Plasma Proteome Project (HPPP): A bridge with the HUPO CardioVascular Initiative and the emergence of SRM targeted proteomics

Gilbert S. Omenn, Mark S. Baker, Ruedi Aebersold
2011 Proteomics  
MS/MS spectra are interrogated against a non-redundant database of exhaustive three-frame translation of Ensembl transcripts and gene models from ECgene using the X!Tandem software.  ...  Plasma samples from selected subgroups of various cohorts have been quantified using iTRAQ following immunodepletion, analysis by LC-MALDI-MS/MS, and then validation.  ...  We anticipate that the progress from such studies of the human plasma proteome will be a good foundation for the HPP and many other basic and clinical applications.  ... 
doi:10.1002/pmic.201100382 pmid:21850651 fatcat:l7mqdoajf5bfdiwkt4cnremidq

Metabolic Signatures in Response to Abscisic Acid (ABA) Treatment in Brassica napus Guard Cells Revealed by Metabolomics

Mengmeng Zhu, Sarah M. Assmann
2017 Scientific Reports  
Information derived from metabolite datasets can provide a blueprint for improvement of water use efficiency and drought tolerance in crops.  ...  During drought, vascular land plants conserve water via stomatal closure.  ...  Acknowledgements This work was supported by the US National Science Foundation grants IOS 1025837 and MCB-1157921 to S.M.A. We thank Dr. Philip B.  ... 
doi:10.1038/s41598-017-13166-w pmid:28993661 pmcid:PMC5634414 fatcat:ef25c5ir3zc6rfvvujzmgycmte

Discovery data topology with the closure structure. Theoretical and practical aspects [article]

Tatiana Makhalova, Aleksey Buzmakov, Sergei O. Kuznetsov, Amedeo Napoli
2021 arXiv   pre-print
Finally, a series of experiments shows how GDPM can be practically used and what can be expected from the output.  ...  While a summarization of a dataset based on a set of patterns does not provide a general and satisfying view over a dataset, we introduce a concise representation -- the closure structure -- based on closed  ...  These sets are used to find a non-redundant set of association rules and implications (rules with confidence 1) that summarizes the data.  ... 
arXiv:2010.02628v3 fatcat:norn5mopb5fpxpdkhrczjpe2yi

P-N-RMiner: a generic framework for mining interesting structured relational patterns

Jefrey Lijffijt, Eirini Spyropoulou, Bo Kang, Tijl De Bie
2016 International Journal of Data Science and Analytics  
Pattern syntaxes include subgroups, n-sets, itemsets, and many more; common data types include binary, categorical, and real-valued.  ...  a taxonomy, etc.  ...  The fixpoint-enumeration algorithm can be used to enumerate all closed patterns from this set system, and it is efficient if we can define an appropriate closure operator.  ... 
doi:10.1007/s41060-016-0004-3 dblp:journals/ijdsa/LijffijtSKB16 fatcat:nlze7bowivan5kdzzzqxr3puxe

Identifying consistent statements about numerical data with dispersion-corrected subgroup discovery

Mario Boley, Bryan R. Goldsmith, Luca M. Ghiringhelli, Jilles Vreeken
2017 Data mining and knowledge discovery  
that are determined by subgroup size (non-decreasing dependence), the subgroup median value, and a dispersion measure around the median (non-increasing dependence).  ...  Empirical evaluation on a wide range of datasets shows that, when used within branch-and-bound search, this approach is highly efficient and indeed discovers subgroups with much smaller errors.  ...  Acknowledgements The authors thank the anonymous reviewers for their useful and constructive suggestions.  ... 
doi:10.1007/s10618-017-0520-3 fatcat:cwwiej6jgnckpl23qwtyqqz2rm

Effective and complete discovery of order dependencies via set-based axiomatization

Jaroslaw Szlichta, Parke Godfrey, Lukasz Golab, Mehdi Kargar, Divesh Srivastava
2017 Proceedings of the VLDB Endowment  
We present a new OD discovery algorithm enabled by a novel polynomial mapping to a canonical form of ODs, and a sound and complete set of axioms (inference rules) for canonical ODs.  ...  We prove that it produces a complete and minimal set of ODs. Using real and synthetic datasets, we experimentally show orders-ofmagnitude performance improvements over the prior stateof-the-art.  ...  Also, we show in Section 5.3 that many "minimal" ODs in [10] are considered non-minimal (redundant) in our representation.  ... 
doi:10.14778/3067421.3067422 fatcat:s5dwqctbtrdzxh5xkco4io2n3e

Exceptional contextual subgraph mining

Mehdi Kaytoue, Marc Plantevit, Albrecht Zimmermann, Anes Bendimerad, Céline Robardet
2017 Machine Learning  
For instance, a bike-sharing system may be modeled as a graph where vertices stand for bike-share stations and connections represent bike trips made by users from one station to another.  ...  The dependency between a context and an edge is assessed by a χ 2 test and the weighted relative accuracy measure is used to only retain contexts that strongly characterize connected subgraphs.  ...  Acknowledgements The authors would like to thank the anonymous reviewers for their frank, fruitful, constructive and insightful comments and the authors of the MiMaG and DSSD algorithms for providing us  ... 
doi:10.1007/s10994-016-5598-0 fatcat:nr22capolbep5mjgfvyjspu3li

Dlx5 and Msx2 regulate mouse anterior neural tube closure through ephrinA5-EphA7

Jangwoo Lee, Amy Corcoran, Manjong Han, David M. Gardiner, Ken Muneoka
2013 Development, Growth and Differentiation  
Dlx5 functions as a transcriptional activator and Msx2 a transcriptional repressor, and they share common target genes.  ...  Interestingly, we observed a high rate of defects in neural tube formation in Dlx5 and Msx2 double null mutants.  ...  Research funded by P01HD022610 from the NIH, W911NF-06-1-0161 from DARPA, W911NF-09-1-0305 from the US Army Research Center, and the John L. and Mary Wright Ebaugh endowment fund at Tulane University.  ... 
doi:10.1111/dgd.12044 pmid:23425387 fatcat:lz6bhw2zynctlgvczckhs34emm
« Previous Showing results 1 — 15 out of 2,467 results