Tree mining consists in discovering the frequent subtrees from a forest of trees. This problem has many application areas. For instance, a huge volume of data available from the In...
Given multiple time sequences with missing values, we propose DynaMMo which summarizes, compresses, and finds latent variables. The idea is to discover hidden variables and learn ...
Lei Li, James McCann, Nancy S. Pollard, Christos F...
In this paper we describe I-Subdue, an extension to the Subdue graph-based data mining system. I-Subdue operates over sequentially received relational data to incrementally discov...
Jeffrey Coble, Diane J. Cook, Lawrence B. Holder, ...
Abstract. We present a Context Ultra-Sensitive Approach based on two-step Recommender systems (CUSA-2step-Rec). Our approach relies on a committee of profile-specific neural networ...
In some applications such as filling in a customer information form on the web, some missing values may not be explicitly represented as such, but instead appear as potentially va...