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...
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
DTD and its instance have been considered the standard for data representation and information exchange format on the current web. However, when coming to the next generation of w...
Data archivists expect information storage media to have a lifetime greater than ten years. Furthermore they desire the ability to predict when the media will fail in order to pla...
Most similarity search techniques map the data objects into some high-dimensional feature space. The similarity search then corresponds to a nearest-neighbor search in the feature...