![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Journal of Intelligent Information Systems (JIIS), Volume 16
Volume 16, Number 1, January 2001
- Yong S. Choi, Suk I. Yoo:
Text Database Discovery on the Web: Neural Net Based Approach. 5-20 - Parke Godfrey, Jarek Gryz:
Partial Evaluation of Views. 21-39 - Iqbal A. Goralwalla, Yuri Leontiev, M. Tamer Özsu
, Duane Szafron, Carlo Combi
:
Temporal Granularity: Completing the Puzzle. 41-63 - Anthony Hunter
:
A Default Logic Based Framework for Context-Dependent Reasoning with Lexical Knowledge. 65-87
Volume 16, Number 2, March 2001
- Zhong Zhang, Qiang Yang:
Feature Weight Maintenance in Case Bases Using Introspective Learning. 95-116 - S. K. Michael Wong:
The Relational Structure of Belief Networks. 117-148 - José Luis Ambite
, Craig A. Knoblock, Ion Muslea, Andrew Philpot:
Compiling Source Descriptions for Efficient and Flexible Information Integration. 149-187
Volume 16, Number 3, August 2001
- Ning Zhong, Juzhen Dong, Setsuo Ohsuga:
Using Rough Sets with Heuristics for Feature Selection. 199-214 - Pawan Lingras:
Unsupervised Rough Set Classification Using GAs. 215-228 - Kewen Wang
, Lizhu Zhou:
An Extension to GCWA and Query Evaluation for Disjunctive Deductive Databases. 229-253 - Daniel Barbará, Xintao Wu
:
Loglinear-Based Quasi Cubes. 255-276 - Brock Barber, Howard J. Hamilton:
Parametric Algorithms for Mining Share Frequent Itemsets. 277-293
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.