Finding Minimal Infrequent Elements in Multi-Dimensional Data Defined over Partially Ordered Sets and its Applications
暂无分享,去创建一个
[1] Elias C. Stavropoulos,et al. Journal of Graph Algorithms and Applications an Efficient Algorithm for the Transversal Hypergraph Generation , 2022 .
[2] Vladimir Gurvich,et al. An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation , 2006, Discret. Appl. Math..
[3] Vladimir Gurvich,et al. On Maximal Frequent and Minimal Infrequent Sets in Binary Matrices , 2003, Annals of Mathematics and Artificial Intelligence.
[4] Vladimir Gurvich,et al. Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data , 2007, Theor. Comput. Sci..
[5] Jiawei Han,et al. Data-Driven Discovery of Quantitative Rules in Relational Databases , 1993, IEEE Trans. Knowl. Data Eng..
[6] Dana L. Dalton. From Silos to Sharing: An Institutional Research View of the Conversion to an ERP , 2012 .
[7] Vladimir Gurvich,et al. Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities , 2002, SIAM J. Comput..
[8] Fabio Stella,et al. Bayesian Belief Networks for Data Cleaning , 2008 .
[9] David J. Evans,et al. Association rules on significant rare data using second support , 2006, Int. J. Comput. Math..
[10] Brian C. Lovell,et al. Support Vector Machines for Business Applications , 2006 .
[11] Arno Scharl,et al. Ontology Learning and Knowledge Discovery Using the Web: Challenges and Recent Advances , 2011 .
[12] Giovanni Felici,et al. Mathematical Methods for Knowledge Discovery and Data Mining , 2007 .