Sciweavers

1768 search results - page 34 / 354
» Mining Very Large Databases
Sort
View
DEXAW
2009
IEEE
131views Database» more  DEXAW 2009»
14 years 4 months ago
Clustering of Short Strings in Large Databases
—A novel method CLOSS intended for textual databases is proposed. It successfully identifies misspelled string clusters, even if the cluster border is not prominent. The method ...
Michail Kazimianec, Arturas Mazeika
GCB
2000
Springer
99views Biometrics» more  GCB 2000»
14 years 1 months ago
Structure Motif Discovery and Mining the PDB
We describe an algorithm for the automatic discovery of recurring patterns in protein structures. The patterns consist of individual residues having a defined order along the prote...
Inge Jonassen, Ingvar Eidhammer, Darrell Conklin, ...
INCDM
2010
Springer
486views Data Mining» more  INCDM 2010»
13 years 12 months ago
Finding Temporal Patterns in Noisy Longitudinal Data: A Study in Diabetic Retinopathy
This paper describes an approach to temporal pattern mining using the concept of user de ned temporal prototypes to de ne the nature of the trends of interests. The temporal patt...
Vassiliki Somaraki, Deborah Broadbent, Frans Coene...
PAKDD
2009
ACM
103views Data Mining» more  PAKDD 2009»
14 years 4 months ago
Hot Item Detection in Uncertain Data
Abstract. An object o of a database D is called a hot item, if there is a sufficiently large population of other objects in D that are similar to o. In other words, hot items are ...
Thomas Bernecker, Hans-Peter Kriegel, Matthias Ren...
BMCBI
2008
208views more  BMCBI 2008»
13 years 10 months ago
GraphFind: enhancing graph searching by low support data mining techniques
Background: Biomedical and chemical databases are large and rapidly growing in size. Graphs naturally model such kinds of data. To fully exploit the wealth of information in these...
Alfredo Ferro, Rosalba Giugno, Misael Mongiov&igra...