Advances in Artificial Intelligence Theory - MICAI - Mexican ...

More documents

Recommendations

Info

10 Liu Q., Lu X., Ren F., Kuroiwa Sh. Code 3 – ESF relation 3 Target patterns extraction in Code 4 – (Obtaining last pattern by recursion) Code 4 – ESF target functions , and After , Put pattern pt 3, pt 6 into target function ft 3 (pt 3,pt 6)=Referring(pt 3,pt 6), and quote the function value as new pattern pt 7. Then put pattern pt 3, pt 7 into target function ft 4 (pt 3, pt 7)=Aggregation(pt 3, pt 7), and quote the function value as new pattern pt 8.
XML based Extended Super-function Schema in Knowledge Representation 11 Then put pattern pt 8, pt 9 into target function ft 5 (pt 8, pt 9)=(After pt 9, pt 8), and quote the function value as new pattern pt 10. The obtained patterns pt 10 is regarded as target patterns. These XSLT codes mentioned above are just a portion of all. If the XML document constructed as Code 1, then all of XSLT codes are implemented, the result text can be obtained as shown in follows: Result "In Tokyo Stock Exchange market, the Tokyo Stock Exchange Prices Index (TOPIX) is analyzed now. ... It opened at 1105.08, and closed at 1109.84 on 2004-08-20. Its total turnover was 1072250000. It opened at 1115.93, and closed at 1114.24 on 2004-08-23. Its total turnover was 1047230000. After positive divergence and bullish moving average crossover of MACD, the stock is oversold, and it is considered bullish signal. It opened at 1116.74, and closed at 1116.60 on 2004-08-24. Its total turnover was 1065260000. ..." 4 Discussion and Conclusion Our hypotheses are that texts which contain technical indicators as described above will help non-experts to retain more information and perform better than charts, and that non-experts will rate these texts as more interesting and pleasant to read. For this point, the evaluation experiment is carried out in which learning outcomes of texts will compare with charts’. The MACD indicator is chosen for the evaluation. For each indicator two evaluation suites are prepared. The only difference between them is that one uses the texts of technical indicators and the other uses the charts. The tested are 40 students who do not have expert knowledge of stock market. They are separated into two equally sized groups. Group A read the charts where the technical indicators are marked and group B read the analysis texts which our KR system generates. After reading, two groups will finish the evaluation suite including ”comprehension”, ”accuracy”, ”time”, ”interest”, ”remembrance”, and ”usefulness” items. The evaluation results are shown in Figure. Obviously, the ”comprehension”, ”interest”, ”remembrance” items’ scores of group B are much higher than group A. Because the tested think not only charts but also texts are necessary for the technical indicators to be described, the ”usefulness” item’s score between group A and group B is about same. Otherwise, the ”accuracy”, ”time” items’ scores of group B approach group A. The reason is that the ESF schema has linguistic completeness and the computer’s speed is much faster than before. The ESF based KR system can generate sufficiently quality analysis texts for non-experts. In the traditional view, KR can be separated into two kinds: Template based KR and standard KR. Template based KR system maps its non-linguistic input directly (i.e., without intermediate representations) to the linguistic surface structure. Crucially, this linguistic structure may contain gaps. Well-formed output can be obtained when the gaps of linguistic structure are filled until the linguistic structure does not contain gaps. By contrast, standard KR systems use a less direct mapping between input and surface
Page 1 and 2: Advances in Artificial Intelligence
Page 3 and 4: Advances in Artificial Intelligence
Page 5 and 6: Preface Artificial Intelligence is
Page 7 and 8: Table of Contents Índice Knowledge
Page 9: Improved Ant Colony System using Su
Page 13 and 14: XML based Extended Super-function S
Page 19: XML based Extended Super-function S
Page 23 and 24: The Description Logic of Tasks 1 Zh
Page 25 and 26: The Description Logic of Task 15 П
Page 27 and 28: The Description Logic of Task 17 4.
Page 29 and 30: The Description Logic of Task 19 {
Page 31 and 32: The Description Logic of Task 21 As
Page 33 and 34: A Logic Programming Formalization f
Page 35 and 36: problems are practically solved by
Page 37 and 38: & Prov(X,p(x),s(a);r(c’),α(x),Y)
Page 39 and 40: It is noted that the second meta-pr
Page 41 and 42: where r is the variable for predica
Page 43: Constraint Satisfaction
Page 46 and 47: 36 H. Terashima, R. De la Calleja,
Page 56 and 57: - Complete algorithms: dedicated to
Page 58 and 59: approach. Its backbone is a basic t
Page 60 and 61: Step 2. Iteration While (iter < max
Page 62 and 63: Table 2. Solutions quality and runn
Page 64 and 65: References 1. D.Boughaci H.Drias
Page 66 and 67: lems due to presence of nasty const
Page 68 and 69: log in the above expression is norm
Page 70 and 71:
in the averaged constraint along th
Page 72 and 73:
to decrease monotonically. In the l
Page 74 and 75:
7. Gent, I.P., MacIntyre, E., Pross
Page 76 and 77:
subset. If so, the solution is not
Page 78 and 79:
In some domains, one can use tricks
Page 80 and 81:
Together, these three conditions en
Page 82 and 83:
5 Evaluation PSIGRAPH was implement
Page 84 and 85:
disadvantage is that it spends larg
Page 87:
Multiagent Systems and Distributed
Page 90 and 91:
This paper structure is as follows:
Page 92 and 93:
(a) AND-join operation. (b) XOR-spl
Page 94 and 95:
0 1800 Decentralized execution Cent
Page 96 and 97:
Compared to agent-enhanced approach
Page 98 and 99:
16. Stormer, H.: A Flexible Agent-b
Page 100 and 101:
90 Martínez F., Rodríguez C. with
Page 102 and 103:
92 Martínez F., Rodríguez C. with
Page 104 and 105:
94 Martínez F., Rodríguez C. Fig.
Page 106 and 107:
96 Martínez F., Rodríguez C. 3. I
Page 108 and 109:
98 Martínez F., Rodríguez C. 2. T
Page 110 and 111:
100 A. Umre, I. Wakeman As well as
Page 112 and 113:
102 A. Umre, I. Wakeman the request
Page 114 and 115:
104 A. Umre, I. Wakeman 3.1 Results
Page 116 and 117:
106 A. Umre, I. Wakeman 3.1.3 Slash
Page 118 and 119:
108 A. Umre, I. Wakeman References
Page 121 and 122:
Some Experiments on Corner Tracking
Page 123 and 124:
Page 125 and 126:
Page 127 and 128:
Page 129 and 130:
Page 131 and 132:
Pattern Decomposition and Associati
Page 133 and 134:
Page 135 and 136:
Page 137 and 138:
Page 139 and 140:
Page 141 and 142:
Object Classification Based on Asso
Page 143 and 144:
Page 145 and 146:
Page 147 and 148:
Page 149 and 150:
Page 151 and 152:
Associative Processing Applied to W
Page 153 and 154:
Page 155 and 156:
Page 157 and 158:
Page 159 and 160:
Page 161:
Machine Learning and Neural Network
Page 164 and 165:
154 Castiello C., Fanelli A. of art
Page 166 and 167:
156 Castiello C., Fanelli A. Fig. 1
Page 168 and 169:
158 Castiello C., Fanelli A. in a n
Page 170 and 171:
160 Castiello C., Fanelli A. among
Page 172 and 173:
162 Castiello C., Fanelli A. organi
Page 174 and 175:
164 J. Saade, A. Fakih In (1), A jr
Page 176 and 177:
166 J. Saade, A. Fakih With h [(s-1
Page 178 and 179:
168 J. Saade, A. Fakih The main rea
Page 180 and 181:
170 J. Saade, A. Fakih possible or
Page 182 and 183:
172 J. Saade, A. Fakih Although the
Page 185 and 186:
Intelligent genetic algorithm: a to
Page 187 and 188:
Intelligent Genetic Algorithm: A To
Page 189 and 190:
Page 191 and 192:
Page 193 and 194:
Page 195 and 196:
Improved Ant Colony System using Su
Page 197 and 198:
Page 199 and 200:
Page 201 and 202:
Page 203 and 204:
Page 205 and 206:
Building Block Filtering Genetic Al
Page 207 and 208:
Page 209 and 210:
Page 211 and 212:
Page 213 and 214:
Page 215 and 216:
Page 217 and 218:
Evolutionary Training of SVM for Cl
Page 219 and 220:
Page 221 and 222:
Page 223 and 224:
Page 225 and 226:
Page 227:
Natural Language Processing
Page 230 and 231:
220 Z. Kozareva, O. Ferrández, A.
Page 232 and 233:
Page 234 and 235:
Page 236 and 237:
Page 238 and 239:
Page 240 and 241:
230 R. Guillen
Page 242 and 243:
232 R. Guillen
Page 244 and 245:
234 R. Guillen
Page 246 and 247:
236 R. Guillen
Page 248 and 249:
238 R. Guillen
Page 250 and 251:
240 Hannon Ch. LEAP is developed us
Page 252 and 253:
242 Hannon Ch. concepts immediately
Page 254 and 255:
244 Hannon Ch. where, n is the leve
Page 256 and 257:
246 Hannon Ch. accessed. The concep
Page 258 and 259:
248 Hannon Ch. a major factor. Init
Page 261 and 262:
Orthogonal-Back Propagation Hybrid
Page 263 and 264:
Page 265 and 266:
Page 267 and 268:
Page 269 and 270:
Page 271 and 272:
Characterization and Interpretation
Page 273 and 274:
Page 275 and 276:
Page 277 and 278:
Page 279:
Page 282 and 283:
272 I. López, A. Rojano ing optima
Page 284 and 285:
274 I. López, A. Rojano r r r r v
Page 286 and 287:
276 I. López, A. Rojano T [ ] of m
Page 288 and 289:
278 I. López, A. Rojano the global
Page 290 and 291:
280 I. López, A. Rojano solving si
Page 293 and 294:
Editorial Board of the Volume Comit
Page 295 and 296:
Additional Reviewers Árbitros adic
Page 297:
Impreso en los Talleres Gráficos d
show all

Advances in Artificial Intelligence Theory - MICAI - Mexican ...

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

Delete template?

Save as template?