11.07.2015 Views

Querying a summary of database - APMD

Querying a summary of database - APMD

Querying a summary of database - APMD

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

64 J Intell Inf Syst (2006) 26: 59–73Table 1 Part <strong>of</strong> theMATERIALS table Materials Tuple TranslationUZ40 t a =〈10, 38, 900〉 t a1 =〈0.7/medium, 1.0/s<strong>of</strong>t,0.85/moderated 〉CuSn12 t b =〈8, 40, 850〉 t b1 =〈0.35/medium, 0.9/s<strong>of</strong>t,1.0/moderated 〉,t b2 =〈0.35/thin, 0.9/s<strong>of</strong>t,1.0/moderated 〉CuAs05 t c =〈12, 44, 896〉 t c1 =〈1.0/medium, 0.4/s<strong>of</strong>t,0.9/moderated 〉,t c2 =〈1.0/medium, 0.4/hard,0.9/moderated 〉Fe t d =〈10, 35, 1530〉 t d1 =〈0.7/medium, 1.0/s<strong>of</strong>t,0.85/normal 〉Ni t e =〈5, 35, 1453〉 t e1 =〈1.0/thin, 1.0/s<strong>of</strong>t,0.96/normal 〉... ... ...Fig. 2 Part <strong>of</strong> a <strong>summary</strong>hierarchy for MATERIALSt e .thickness = 5 mm is expressed as t e1 .thickness ={1.0/thin} where 1.0 tells howwell the label thin describes the value 5mm(1.0 is the satisfaction degree <strong>of</strong> thin by 5mm).Applying this mapping to each attribute <strong>of</strong> a relation corresponds to a translation <strong>of</strong> the initialtuple into another expression called a candidate tuple.One attribute value may be described by more than one fuzzy label (e.g. 8mmis describedby medium and thin). It follows that one tuple (for instance t b and t c in Table 1) may yieldmany candidate tuples.Second, each candidate tuple is incorporated into the growing hierarchy and reaches a leafnode where other candidate tuples with the same labels are stored. This can be seen as a classification<strong>of</strong> the candidate tuple. It is important to notice that the tree is modified throughoutcandidate tuples incorporation: it progressively becomes a complete representation <strong>of</strong> thedata. Its evolution is partly controlled by learning operators (see Raschia, 2001) that try tomaximize the inner-class similarity and the inter-class dissimiliarity.An analogy could be that the hierarchy <strong>of</strong> summaries is a network <strong>of</strong> pipes with a singleentry point at the top and several outlets to a set <strong>of</strong> buckets at the bottom, one outlet perbucket. Candidate tuples can be seen as objects <strong>of</strong> different types. From the entry, an object isdirected to the bucket it belongs to. But through the process <strong>of</strong> reaching the adequate bucket,it creates some structural modifications in the network <strong>of</strong> pipes so some craftsmen (that is, thelearning operators) have to constantly adapt the network. Some junctions are made thinneror larger, some pipes are added or deleted, etc... In the end, all objects <strong>of</strong> the same type aredispatched into buckets and the lengths <strong>of</strong> paths to the buckets are minimal. Each bucket thatSpringer

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!