This study investigates an approach of knowledge discovery and data mining in insufficient databases. An application of Computational Taxonomy analysis demonstrates that the approach is effective in such a data mining process. The approach is characterized by the use ot…

In this position paper, the main steps to measure and evaluate quantitatively the quality of sites are shown. Besides, some specific models, criteria and procedures to apply in these activities are discussed by quoting case studies already performed (e.g., in…

With the growing complexity of window based software and the use of object-oriented, the development of software is getting more complex than ever. Based on that, this article intends to present a methodology for software documentation and to analyze our…

In this work, a conceptual framework and the associated strategies for metrics and model validation are analyzed regarding website measurement and evaluation. Particularly, we have conducted three case studies in different Web domains in order to evaluate and compare the…

It is commonly said that a pattern has four essential parts: a statement of the context where the pattern is useful, the problem that the pattern addresses, the forces that play in forming a solution, and the solution that resolves…

This study investigates an approach of knowledge discovery and data mining in insufficient databases. An application of Computational Taxonomy analysis demonstrates that the approach is effective in such a data mining process. The approach is characterized by the use of…

Vertical partitioning, in which attributes of a relation are
assigned to partitions, is aimed at improving database
performance. We extend previous research that is based on
a single relation to multi-relation database environment,
by including referential integrity constraints, access time

This paper is an attempt to define how a
specific data structure might be used to
store, in a persistent manner, temporal
information during a computer simulation.
In particular, it considers the sort of
temporal information generated during a
discrete…

Similarity search is a fundamental operation for applications that deal with unstructured data sources. In this paper we propose a new pivot-based method for similarity search, called Sparse Spatial Selection (SSS).
The main characteristic of this method is that it…

The metric spaces model formalizes the similarity search concept in nontraditional databases. The goal is to build an index designed to save distance computations when answering similarity queries later. A large class of algorithms to build the index are based…