检索结果-内蒙古大学图书馆

A clustering method based on rough sets and its application to biochemical data analysis

A clustering method based on rough sets and its application ...

Proceedings of the Atlantic Symposium on Computational Biology and Genome Information Systems and technology, GBGIST 2001

作者： Hirano, Shoji Okuzaki, Tomohiro Hata, Yutaka Tsumoto, Shusaku Tsumoto, Kouhei Department of Computer Engineering Himeji Institute of Technology 2167 Shosha Himeji 671-2201 Japan Department of Medical Informatics Shimane Medical University School of Medicine 89-1 Enya-cho Izumo-City Shimane 693-8501 Japan Department of Biomolecular Eng. Graduate School of Engineering Tohoku University Aoba-yama 07 Sendai 980-8579 Japan

ISBN: (纸本)0970789009

This paper presents a rough-sets-based method for clustering data composed of both nominal and numerical attributes. Similarity between objects is determined as a weighted sum of their Hamming / Mahalanobis distances. The method then forms equivalence relations among objects based on their relative similarity, and classifies them into some categories according to the relations. Similar equivalence relations will be merged into an equivalence relation so that it represents more simple knowledge which generates adequate number of categories. The optimal clustering result can be obtained by evaluating the cluster validity, defined using upper and lower approximations of a cluster, over all clusters generated with various values of similarity thresholds. Experimental results on the amino acid data show that our method can deal well with both attributes and produces good clustering results.

关键词： Biochemistry

来源：评论

学校读者我要写书评

暂无评论

Fast content-based search of VRML models based on shape descriptors

Fast content-based search of VRML models based on shape desc...

引用

IEEE International Conference on Image Processing

作者： L. Kolonias D. Tzovaras S. Malassiotis M.G. Strintzis Information Processing Laboratory Electrical and Computer Engineering Department Aristotle University of Thessaloniki Thessaloniki Greece Center for Research and Technology Hellas Informatics and Telematics Institute Thessaloniki Greece

Thepaper proposes a novel method for content-based search in a database of VRML 3D models. The proposed technique is based on a querying-by-3D-model approach. A set of shape-based descriptors are extracted from the reference 3D model and compared to the corresponding descriptors of the VRML models contained in the database. The descriptors used vary from simple geometric measurements such as the aspect ratio or a binary 3D shape mask to more complex and sophisticated shape-based criteria such as the edge paths of each 3D model. Similarity measures are then introduced for the specific descriptors and introduced into a 3D model-matching algorithm. Experimental results are presented, evaluating the performance of the proposed method.

关键词： Shape measurement Solid modeling Spatial databases Content based retrieval Iterative algorithms Information processing Laboratories Data engineering Data mining computer networks

来源：评论

学校读者我要写书评

暂无评论

Learning relational rule from examples that are neither positive nor negative

引用

Systems and computers in Japan 2001年第14期32卷 34-40页

作者： Ichise, Ryutaro Numao, Masayuki Knowledge Systems Research Intelligent Systems Research Division National Institute of Informatics Tokyo 101-8430 Japan Department of Computer Science Graduate School of Information Science and Engineering Tokyo Institute of Technology Tokyo 152-8552 Japan

Over the past decade, several inductive logic programming (ILP) systems have been developed. However, the normal ILP system does not have enough power to induce logic programs in some domains. Therefore, various new ILP systems, such as nonmonotonic ILP, that apply new learning tasks, have been proposed. In the present paper, a new learning task, called relational learning from nondichotomizable examples, is proposed for relational domains. The scheme of this task is similar to that of normal ILP, with the exception of the training examples. Normally, conventional ILP uses positive and negative examples in the training process. However, the examples of the proposed learning task are not strictly positive or negative: the training examples have a continuous scale. This new learning task is defined and a new method for learning this task is proposed. A new ILP system, SYNGIP (for SYNthesized system using Genetic programming and Inductive logic Programming), is developed based on this method and the performance of SYNGIP is compared experimentally to that of the conventional ILP method for the task of human feeling acquisition. © 2001 Scripta Technica, Syst. Comp. Jpn.

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

An experimental study of dynamic algorithms for transitive closure

引用

ACM Journal of Experimental Algorithmics 2001年 6卷 9–es页

作者： Frigioni, Daniele Miller, Tobias Nanni, Umberto Zaroliagis, Christos Dipartimento di Ingegneria Elettrica Universita dell'Aquila Monteluco di Roio 1-67040 L'Aquila Italy Transport- Informatik- und Logistik-Consulting GmbH Frankfurt Germany Dipartimento di Informatica e Sistemistica Universita di Roma la Sapienza 00198 Rome Via Salaria 113 Italy Computer Technology Institute University of Patras Department of Computer Engineering and Informatics 26500 Patras Greece

We have performed an extensive experimental study of several dynamic algorithms for transitive closure. In particular, we have implemented algorithms given by Italiano, Yellin, Cicerone et al., and two recent randomized algorithms by Henzinger and King. We propose a fine-tuned version of Italiano's algorithms as well as a new variant of them, both of which were always faster than any of the other implementations of the dynamic algorithms. We also considered simple-minded algorithms that were easy to implement and likely to be fast in practice. We tested and compared the above implementations on random inputs, on non-random inputs that are worst-case inputs for the dynamic algorithms, and on an input motivated by a real-world graph.

关键词： Dynamic Algorithm Experimentation Transitive Closure

来源：评论

学校读者我要写书评

暂无评论

Self-adaptive evolution strategies for ARMA model identification 10

Self-adaptive evolution strategies for ARMA model identifica...

引用

2000 10th European Signal Processing Conference, EUSIPCO 2000

作者： Beligiannis, G.N. Demiris, E.N. Likothanassis, S.D. Department of Computer Engineering and Informatics University of Patras Rion Patras26500 Greece Computer Technology Institute Kolokotroni 3 Patras Greece Rion Patras26500 Greece

ISBN: (纸本)9789521504433

This work presents the application of Evolutionary Computation techniques to the identification (order selection and parameter estimation) of an AutoRegressive Moving Average model (ARMA). Our method combines the effectiveness of the Multi Model Partitioning (MMP) theory with the robustness of the Genetic Algorithms (GAs) in order to give optimum estimations of the noise sequence embedded to the moving average terms of the model. Although the noise sequence's coding is very complicated, the proposed algorithm succeeds better results compared to the classical methods, since it has the ability to search the whole values' range. This is because, in contradiction with all the known classical methods, our algorithm is able to estimate with high precision the unknown parameters even in the case of large order in the moving average terms of the model. © 2000 EUSIPCO.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Towards structure specification for open hypermedia systems 6th

Towards structure specification for open hypermedia systems

引用

6th International Workshop on Open Hypermedia Systems, OHS 2000 and 2nd International Workshop on Structural Computing, SC 2000

作者： Vaitis, Michalis Papadopoulos, Athanasios Tzagarakis, Manolis Christodoulakis, Dimitris Department of Computer Engineering and Informatics University of Patras PatrasGR-265 00 Greece Computer Technology Institute Riga Ferraiou 61 PatrasGR-262 21 Greece

ISBN: (纸本)3540410848

Driven by the philosophy of the "primacy of structure over data", CB-OHS present an open set of structure servers providing structural abstractions of different hypermedia domains. To address the emerged requirements and to facilitate the development of structure servers, structure should be handled as a first class entity. We propose patterns for structure, called templates, that define the structural model upon which structure servers operate. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Hypermedia systems

来源：评论

学校读者我要写书评

暂无评论

A Web adaptive educational system for people with hearing difficulties

引用

Education and Information Technologies 2000年第3期5卷 189-200页

作者： Markellou, Penelope Rigou, Maria Sirmakessis, Spiros Tsakalidis, Athanasios Computer Engineering and Informatics Department Multimedia Graphics and GIS Lab. University of Patras Patras 26500 Greece Internet and Multimedia Technologies Research Unit Computer Technology Institute Patras 26221 61 Riga Feraiou Str. Greece

In this paper we present a web adaptive educational tool for the Greek Sign Language. The design and the implementation of the tool were partially funded by national bodies. The paper presents the architecture of the tool, in an abstract way and briefly describes its functionality. The interaction process followed is also presented. © 2000 Kluwer Academic Publishers.

关键词： Architecture Hearing difficulties Interactive learning Sign language

来源：评论

学校读者我要写书评

暂无评论

Distributed virtual learning environment: a Web-based approach

Distributed virtual learning environment: a Web-based approa...

引用

EUROMICRO Conference

作者： C. Bouras A. Philopoulos Computer Technology Institute-CTI Department of Computer Engineering and Informatics University of Patras Greece Department of Computer Engineering and Informatics University of Patras Greece

In this paper, we present a Web-based distributed virtual learning environment (DVLE) that could be used as a sophisticated tool for distance education and collaboration between teachers and students. We design and develop this application and the corresponding graphical user interface (GUI) as a proposal that aims at providing an integrated communication environment which supplies the communicative needs of an educational community, using the latest telecommunication and multimedia information processing technology. The environment that we propose can be used for virtual lectures, virtual conferences, and exchange of useful material and experiences among teachers and students. It is a Web-based application that is being developed as client/server architecture using standard protocols and technologies such as HTTP, HTML, Java and VRML.

关键词： Graphical user interfaces Distance learning Collaborative tools Proposals Information processing Educational technology Web server Standards development Protocols HTML

来源：评论

学校读者我要写书评

暂无评论

2-D Spatial indexing scheme in optimal time

引用

East-European Conference on Advances in Databases and Information Systems Held Jointly with International Conference on Database Systems for Advanced Applications, ADBIS-DASFAA 2000

作者： Kitsios, Nectarios Makris, Christos Sioutas, Spyros Tsakalidis, Athanassios Tsaknakis, Jhon Vassiliadis, Bill Department of Computer Engineering and Informatics: Graphics Multimedia and GIS Laboratory University of Patras Patras26500 Greece Computer Technology Institute: Research Unit 5 P.O. Box 1122 Patras26110 Greece

ISBN: (纸本)3540679774

We consider the 2-dimensional space with integer coordinates in the range [1, N] × [1, N]. We present the MPST (Modified Priority Search Tree) index structure which reports the k points that lie inside the quadrant query range (, b] × (, c] in optimal O(k) time. Our Index Scheme is simple, fast and it can be used in various geometric or spatial applications such as: (1) 2 D dominance reporting on a grid (2) 2D maximal elements on a grid. Then, based on structures of Gabow et al. [6] and Beam and Fich [31] we describe an index scheme, which handles in an efficient way window queries in spatial database applications. In the general case in which the plane has real coordinates the above time results are slowed down by adding a logarithmic factor due to the normalization technique. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Query languages

来源：评论

学校读者我要写书评

暂无评论

Locating information with uncertainty in fully interconnected networks 14th

引用

14th International Conference on Distributed Computing, DISC 2000

作者： Kirousis, Lefteris M. Kranakis, Evangelos Krizanc, Danny Stamatiou, Yannis C. University of Patras Department of Computer Engineering and Informatics RioPatras26500 Greece Carleton University School of Computer Science OttawaONK1S 5B6 Canada Wesleyan University Department of Mathematics MiddletownCT06459 United States University of Patras Department of Computer Engineering and Informatics Rio Patras Greece and Computer Technology Institute Kolokotroni 3 GR-262 21 Patras26500 Greece

ISBN: (纸本)3540411437

We consider the problem of searching for a piece of information in a fully interconnected computer network (or clique) by exploiting advice about its location from the network nodes. Each node contains a database that "knows" what kind of documents or information are stored in other nodes (e.g. a node could be a Web server that answers queries about documents stored on the Web). The databases in each node, when queried, provide a pointer that leads to the node that contains the information. However, this information is up-to-date (or correct) with some bounded probability. While, in principle, one may always locate the information by simply visiting the network nodes in some prescribed ordering, this requires a time complexity in the order of the number of nodes of the network. In this paper, we provide algorithms for locating an information node in the complete communication network, that take advantage of advice given from network nodes. The nodes may either give correct advice, by pointing directly to the information node, or give wrong advice by pointing elsewhere. We show that, on the average, if the probability p that a node provides correct advice is asymptotically larger than 1/ra, where n is the number of the computer nodes, then the average time complexity for locating the information node is, asymptotically, 1/p or 2/p depending on the available memory. The probability p may, in general. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：