Results 1 - 10
of
12,958
Table 4. Quality elements for the ontological features. Abbreviations: CC = classification correctness, QAA = quantitative attribute accuracy, NR = not relevant.
"... In PAGE 7: ... 3.2 Quality Elements Table4 describes the quality of the objects in a general fashion that apply to the case study. Different membership functions occur, whereas spatial and temporal precision apply to a lmited set of objects.... ..."
Table 2: Linguistic ratings of alternatives and importance level of attributes Attributes Cost(Cc)y Quality (Cq)z Leadtime (Cl)y Transportation (Ct)y Alternatives Very Import. Important Extrem. Import. Important
"... In PAGE 19: ... 1. DMs apos; importance level for criteria and fuzzy ratings of alternatives: Table2 shows non- linguistic and the linguistic ratings (Rij) for the various alternatives (Aj) with respect to each criteria (Ci), and the level of importance (Wi) for each criteria expressed by the decision maker. Note that the cost of accomplishing the task using di erent alternatives are available as range values or (P-ML-O) values for A4.... In PAGE 30: ... To illustrate the procedure consider alternative A1. The membership functions for its ratings (Ri1) and for the weights (Wi) of the four selection criteria are plotted below (refer Table2 ). Table 4 shows the points ^ ri1 and ^ wi where the membership functions Ri1( ^ ri1) and Wi( ^ wi) assume values of 0 and 1.... ..."
TABLE 1. Measures that can be calculated by the r.le programs. gp=attribute group, CC=center-to-center distance, CE=center-to-edge distance, EE=edge-to-edge distance.
Table B.1. Accuracies (%) and theory complexities of C4.5, XofN, XofN(c), and XofN(cc) in the arti cial and natural domains. XofN(c) and XofN(cc) are two variants of XofN. XofN(c) treats X-of-Ns as numeric attributes when using them to build decision trees. XofN(cc) treats X-of-Ns as numeric attributes both when constructing them and when using them to build decision trees. In the table, ( ) indicates that the prediction accuracy or theory complexity of an algorithm is signi cantly better (worse) than that of C4.5. These results show that numeric X-of-N representations do not su er from the fragmentation problem, but on average they perform slightly worse than nominal X-of-N representations in the natural domains.
2000
Cited by 12
Table 3. Optimal k-Values with R, Q and MSE for the CC Strategy
"... In PAGE 26: ... Second, removing a certain percentage of data from two data sets with different numbers of attributes but the same number of cases would result in different numbers of complete cases. Table3 and Table 4 show the observed optimal k-values for the CC strategy and the IC strategy, respectively, given the average number of complete cases for the simulated percentages. It can be seen that the optimal value of k for a certain number of neighbours is the same regardless of strategy.... In PAGE 29: ... The diagram (for six attributes) can be seen in Fig. 5 (for the raw numbers, see Table3 and Table 4). Both neighbour strategies provide nearly maximum ability (R) up to around 30% missing data (when, on average, 88% of the cases are incomplete).... ..."
Table 1 - WWW object
Table 7 defines the C8CTD6CXD3CSC8D6CTD7CTD6DACXD2CV property. If this property holds at a parent node, it also holds at a child, except in the following cases: (1) when the parent operation is a projection not involving the time attributes and whose BWD9D4D0CXCRCPD8CTD7CACTD0CTDACPD2D8 property does not hold; (2) when the parent operation is regular aggregation, where the time attributes are not among the grouping attributes and the aggregation functions used are not among BTCEBZ, CBCDC5, or BVC7CDC6CC; (3) when the parent operation is temporal aggregation; (4) when the parent operation is coalescing and the argument does not have duplicates in snapshots; and (5) when the parent operation is temporal difference and the right argument is the child in question.
"... In PAGE 29: ... Table7 : The C8CTD6CXD3CSC8D6CTD7CTD6DACXD2CV Property Values of an Operation According to its Parent If the property does not hold at the parent operation, the property also does not hold at a child, except in eight cases, namely for the following parent operations: (1) selection with a predicate involving a temporal attribute; (2) projection, if it involves one time attribute or if its BWD9D4D0CXCRCPD8CTD7CACTD0CTDACPD2D8 property holds; (3) regular aggregation, where the time attributes are among the grouping attributes or the aggregation functions are among BTCEBZ, CBCDC5, or BVC7CDC6CC; (4) regular duplicate elimination; (5) regular Cartesian product; (6) temporal Cartesian product if it is not followed by a projection removing the original time attributes; (7) regular difference; and (8) regular union.... ..."
Table 1, the values of the attributes set when M1 is used are presented in Table 2 and the clusters obtained are shown in Table 3:
"... In PAGE 3: ... Table1 : Code example. Method FIV CC A.... ..."
Cited by 1
Table 1: cc syntax
2002
"... In PAGE 4: ... The language. The syntax of a cc program is show in Table1 : P is the class of programs, F is the class of sequences of procedure declarations (or clauses), A is the class of agents, c ranges over constraints, and x is a tuple of variables. Each procedure is defined (at most) once, thus nondeterminism is expressed via the + combinator only.... ..."
Cited by 38
Results 1 - 10
of
12,958