We consider a model in which background knowledge on a given domain of interest is available in terms of a Bayesian network, in addition to a large database. The mining problem is...
To efficiently find global patterns from a multi-database, information in each local database must first be mined and summarized at the local level. Then only the summarized infor...
In this work, we study a visual data mining problem: Given a set of discovered overlapping submatrices of interest, how can we order the rows and columns of the data matrix to bes...
Ruoming Jin, Yang Xiang, David Fuhry, Feodor F. Dr...
Wepresent a methodfor discovering informative patterns from data. With this method,large databases can be reducedto only a few representative data entries. Ourframeworkencompasses...
In the recent years, our ability of collecting information rapidly increases and huge databases that change over time in a high frequency have been developed. On the other hand, th...