The discovery of biclusters, which denote groups of items that show coherent values across a subset of all the transactions in a data set, is an important type of analysis perform...
Gaurav Pandey, Gowtham Atluri, Michael Steinbach, ...
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Research in relational data mining has two major directions: finding global models of a relational database and the discovery of local relational patterns within a database. While...
In many applications, we find large video collections from different genres where the user is often only interested in one or two specific video genres. So, when users are queryin...
It is not always clear how best to represent integrated data sets, and which application and database features allow a scientist to take best advantage of data coming from various ...
Joanna Jakubowska, Ela Hunt, John McClure, Matthew...