Written by students who passed Immediately available after payment Read online or as PDF Wrong document? Swap it for free 4.6 TrustPilot
logo-home
Summary

Summary LNAI 3127 Concept Based Data Mining with Scaled Labeled Graphs 1st Edition by Bernhard Ganter, Peter Grigoriev, Sergei Kuznetsov, Mikhail Samokhin ISBN X - PDF Download

Rating
-
Sold
-
Pages
52
Uploaded on
25-07-2025
Written in
2024/2025

LNAI 3127 Concept Based Data Mining with Scaled Labeled Graphs 1st Edition by Bernhard Ganter, Peter Grigoriev, Sergei Kuznetsov, Mikhail Samokhin ISBN X - PDF dowload at

Institution
Course

Content preview

LNAI 3127 Concept Based Data Mining with Scaled
Labeled Graphs 1st Edition by Bernhard Ganter,
Peter Grigoriev, Sergei Kuznetsov, Mikhail
Samokhin ISBN 9783540206460 354020646X pdf
download
https://ebookball.com/product/lnai-3127-concept-based-data-
mining-with-scaled-labeled-graphs-1st-edition-by-bernhard-ganter-
peter-grigoriev-sergei-kuznetsov-mikhail-samokhin-
isbn-9783540206460-354020646x-13116/




Explore and download more ebooks or textbooks
at ebookball.com

, Get Your Digital Files Instantly: PDF, ePub, MOBI and More
Quick Digital Downloads: PDF, ePub, MOBI and Other Formats




LNAI 3191 Multi agent Systems and Distributed Data Mining 1st Edition
by Chris Giannella, Ruchita Bhargava, Hillol Kargupta ISBN
9783540206460 354020646X


https://ebookball.com/product/lnai-3191-multi-agent-systems-and-
distributed-data-mining-1st-edition-by-chris-giannella-ruchita-
bhargava-hillol-kargupta-isbn-9783540206460-354020646x-11934/



LNAI 3171 An Efficient Clustering Method for High Dimensional Data
Mining 1st Edition by Jae Woo Chang, Yong Ki Kim ISBN 9783540206460
354020646X


https://ebookball.com/product/lnai-3171-an-efficient-clustering-
method-for-high-dimensional-data-mining-1st-edition-by-jae-woo-
chang-yong-ki-kim-isbn-9783540206460-354020646x-8848/



LNAI 2903 Robustness for Evaluating Rule Generalization Capability in
Data Mining 1st Edition by Dianhui Wang, Tharam Dillon, Xiaohang Ma
ISBN 9783540206460 354020646X


https://ebookball.com/product/lnai-2903-robustness-for-
evaluating-rule-generalization-capability-in-data-mining-1st-
edition-by-dianhui-wang-tharam-dillon-xiaohang-ma-
isbn-9783540206460-354020646x-11134/


LNAI 2903 Fuzzy Cognitive Map Learning Based on Nonlinear Hebbian Rule
1st Edition by Elpiniki Papageorgiou, Chrysostomos Stylios, Peter
Groumpos ISBN 9783540206460 354020646X


https://ebookball.com/product/lnai-2903-fuzzy-cognitive-map-
learning-based-on-nonlinear-hebbian-rule-1st-edition-by-elpiniki-
papageorgiou-chrysostomos-stylios-peter-groumpos-
isbn-9783540206460-354020646x-10728/

,LNAI 2903 Model Based Reinforcement Learning for Alternating Markov
Games 1st Edition by Drew Mellor ISBN 9783540206460 354020646X



https://ebookball.com/product/lnai-2903-model-based-
reinforcement-learning-for-alternating-markov-games-1st-edition-
by-drew-mellor-isbn-9783540206460-354020646x-10942/



LNAI 2903 Pareto Neuro Ensembles 1st Edition by Hussein Abbass ISBN
9783540206460 354020646X



https://ebookball.com/product/lnai-2903-pareto-neuro-
ensembles-1st-edition-by-hussein-abbass-
isbn-9783540206460-354020646x-9200/



LNAI 2903 Dynamic Games to Assess Network Value and Performance 1st
Edition by Gregory Calbert, Peter Smet, Jason Scholz , Hing Wah Kwok
ISBN 9783540206460 354020646X


https://ebookball.com/product/lnai-2903-dynamic-games-to-assess-
network-value-and-performance-1st-edition-by-gregory-calbert-
peter-smet-jason-scholz-hing-wah-kwok-
isbn-9783540206460-354020646x-9740/


LNAI 2903 MML Classification of Music Genres 1st Edition by Adrian
Bickerstaffe, Enes Makalic ISBN 9783540206460 354020646X



https://ebookball.com/product/lnai-2903-mml-classification-of-
music-genres-1st-edition-by-adrian-bickerstaffe-enes-makalic-
isbn-9783540206460-354020646x-14280/



LNAI 2903 Reduction of Non Deterministic Automata for Hidden Markov
Model Based Pattern Recognition Applications 1st Edition by Frederic
Maire, Frank Wathne, Alain Lifchitz ISBN 9783540206460 354020646X


https://ebookball.com/product/lnai-2903-reduction-of-non-
deterministic-automata-for-hidden-markov-model-based-pattern-
recognition-applications-1st-edition-by-frederic-maire-frank-
wathne-alain-lifchitz-isbn-9783540206460-354020646x/

, Concept-Based Data Mining with Scaled
Labeled Graphs

Bernhard Ganter, Peter A. Grigoriev, Sergei O. Kuznetsov, and
Mikhail V. Samokhin

Technische Universität Dresden
All-Russian Institute for Scientific and Technical Information



Abstract. Graphs with labeled vertices and edges play an important
role in various applications, including chemistry. A model of learning
from positive and negative examples, naturally described in terms of For-
mal Concept Analysis (FCA), is used here to generate hypotheses about
biological activity of chemical compounds. A standard FCA technique
is used to reduce labeled graphs to object-attribute representation. The
major challenge is the construction of the context, which can involve ten
thousands attributes. The method is tested against a standard dataset
from an ongoing international competition called Predictive Toxicology
Challenge (PTC).


1 Introduction
In [1] we introduced a general construction based on a semilattice of object
description, which we called pattern structure. An example that we used was
related to a lattice on sets of labeled graphs. In general, pattern structures are
naturally reduced to formal contexts. In this paper we present a practical data
mining approach which uses JSM or concept-based hypotheses. On the data side
we use a standard FCA technique, called ordinal scaling [2] for the reduction of
labeled graphs to formal contexts. We consider a chemical application in Predic-
tive Toxicology and compare the results to those obtained with the same learning
model, but different representation language which used predefined descriptors
(attributes) for describing chemical compounds.


2 A Learning Model
2.1 Pattern Structures
In [1] we showed how such an approach is linked to the general FCA frame-
work [2]. In [3] and in [4] we showed how this approach is related to standard
machine learning models such as version spaces and decision trees.
Let G be some set, let (D, ) be a meet-semilattice and let δ : G → D be a
mapping. Then (G, D, δ) with D = (D, ) is called a pattern structure, provided
that the set
δ(G) := {δ(g) | g ∈ G}

K.E. Wolff et al. (Eds.): ICCS 2004, LNAI 3127, pp. 94–108, 2004.

c Springer-Verlag Berlin Heidelberg 2004

Written for

Course

Document information

Uploaded on
July 25, 2025
Number of pages
52
Written in
2024/2025
Type
SUMMARY

Subjects

Free
Get access to the full document:
Download

Wrong document? Swap it for free Within 14 days of purchase and before downloading, you can choose a different document. You can simply spend the amount again.
Written by students who passed
Immediately available after payment
Read online or as PDF

Get to know the seller
Seller avatar
tresblozala

Get to know the seller

Seller avatar
tresblozala
Follow You need to be logged in order to follow users or courses
Sold
-
Member since
10 months
Number of followers
0
Documents
9
Last sold
-

0.0

0 reviews

5
0
4
0
3
0
2
0
1
0

Why students choose Stuvia

Created by fellow students, verified by reviews

Quality you can trust: written by students who passed their tests and reviewed by others who've used these notes.

Didn't get what you expected? Choose another document

No worries! You can instantly pick a different document that better fits what you're looking for.

Pay as you like, start learning right away

No subscription, no commitments. Pay the way you're used to via credit card and download your PDF document instantly.

Student with book image

“Bought, downloaded, and aced it. It really can be that simple.”

Alisha Student

Working on your references?

Create accurate citations in APA, MLA and Harvard with our free citation generator.

Working on your references?

Frequently asked questions