Sciweavers

4560 search results - page 570 / 912
» Finding Data in the Neighborhood
Sort
View
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
16 years 7 months ago
Characteristic relational patterns
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...
Arne Koopman, Arno Siebes
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
16 years 7 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye
INTERACTION
2009
ACM
16 years 1 months ago
DTD2OWL: automatic transforming XML documents into OWL ontology
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...
Pham Thi Thu Thuy, Young-Koo Lee, Sungyoung Lee
MSS
2000
IEEE
121views Hardware» more  MSS 2000»
15 years 11 months ago
Accelerated Aging Studies and the Prediction of the Archival Lifetime of Optical Disk Media
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...
David E. Nikles, John M. Wiest
SIGMOD
1997
ACM
127views Database» more  SIGMOD 1997»
15 years 11 months ago
Fast Parallel Similarity Search in Multimedia Databases
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...
Stefan Berchtold, Christian Böhm, Bernhard Br...