3791 search results - page 377 / 759 » Packing sets of patterns |
131
click to vote
DAWAK
2010
Springer
15 years 5 months ago
2010
Springer
Frequent sub-graph mining entails two significant overheads. The first is concerned with candidate set generation. The second with isomorphism checking. These are also issues with ...
185
click to vote
DATAMINE
1999
15 years 4 months ago
1999
Abstract. We describe a scalable parallel implementation of the self organizing map (SOM) suitable for datamining applications involving clustering or segmentation against large da...
217
click to vote
COMPGEOM
2011
ACM
14 years 8 months ago
2011
ACM
Many real-world data sets can be viewed of as noisy samples of special types of metric spaces called metric graphs [16]. Building on the notions of correspondence and GromovHausdo...
124
click to vote
RECOMB
2009
Springer
16 years 5 months ago
2009
Springer
The combination of fully sequence genomes and new technologies for high density arrays and ultra-rapid sequencing enables the mapping of generegulatory and epigenetics marks on a g...
126
click to vote
KDD
2004
ACM
16 years 5 months ago
2004
ACM
Most data mining algorithms require the setting of many input parameters. Two main dangers of working with parameter-laden algorithms are the following. First, incorrect settings ...