Posted on

Efficient Decision Support Systems - Practice and Challenges by Edited by: Chiang Jao

By Edited by: Chiang Jao

Show description

Read or Download Efficient Decision Support Systems - Practice and Challenges From Current to Future PDF

Best nonfiction_5 books

Management: Meeting and Exceeding Customer Expectations, 9th Edition

Administration: assembly AND EXCEEDING purchaser expectancies, 9th version is a accomplished survey of the foundations and practices of administration as they're being utilized around the globe. The content material and lines are dependent to enhance carrying on with issues which are woven into the chapters' narratives: 1) the endless attempt by means of managers and businesses to satisfy or exceed shopper wishes, and a pair of) the necessity of businesses and their humans to be guided by means of powerful management.

Extra resources for Efficient Decision Support Systems - Practice and Challenges From Current to Future

Example text

G2 can be projected in the graph G1 through the projections P1 and G1 is more specific than G2. We use injective projections. Two different nodes of one graph have two different images in the other graph. Maximal join is a projection based operation defined on conceptual graphs. for Soft Data Fusion Semantic Knowledge Representations for Soft Data Fusion Semantic Knowledge Representations 21 19 The maximal join is composed of two components. First, it tests the compatibility of two elements of the graphs and then fuses them actually.

Let t be the threshold defined by the end user. t ∈ R +∗ . (v1 , v2 ) ∈ R2 are two numerical values that must be compared. 3 Similarity regarding the context of the concepts In order to compare the context in which the two concepts are expressed, we propose to compare their immediate neighborhood. Intuitively, the similarity measure of two concepts regarding their context is processed by measuring the proportion of relations linked to the concepts and that have the same type and the proportion of relations that have different types.

G2 ). simGraph ( G1 , G2 ) = ∑ (maxc2 ∈C2 p(t1,2 ) ∗ sim|gene (c1 , c2 )) c1 ∈C1 ∑ (c1 ,c2 )∈C1 ×C2 | p(t1,2 ) ∀c3 ∈C2 ,c3 =c2 ∧ sim|gene (c1 ,c3 )

Download PDF sample

Rated 4.78 of 5 – based on 32 votes