Home Kontakt Lehre Research Software


Publications of year 1994

Books and proceedings

  • Donald E. Knuth and Silvio Levy. The CWEB System of Structured Documentation. 1994.
  • Benjamin Kuipers. Qualitative Reasoning -- Modeling and Simulation with Incomplete Knowledge. 1994.
    Abstract: Table of Contents: Concepts of Qualitative Simulation, The QSIM Representation, Solving Qualitative Constraints, Dynamic Qualitative Simulation, Case Studies: Elementary Qualitative Models, Comparative Statics, Region Transitions, Semi-Quantitative Reasoning, Higher Order Derivatives, Global Dynamical Constraints, Time-Scale Abstraction, Component-Connection Models, Compositional Modeling

Articles in journal or book's chapters

  • P. Bauer, E.P. Klement, A. Leikermoser, and B. Moser. Interpolation and approximation of real input-output functions using fuzzy rule bases. In Kruse R., J. Gebhardt, and R. Palm, editors,Fuzzy Systems in Computer Science, pages 245--254. 1994.
    Keywords: Fuzzy Models.
    Abstract: It is shown how fuzzy controllers, in particular the Mamdani and Sugeno controller, can be used to interpolate and approximate control functions, i.e., input-output functions which assign to each input value a real output value.
  • W. Brian Arthur. Complexity Reasoning and Bounded Rationality. Complexity in Economic Theory, 84(2):406--411, 1994.
  • Bhavik R. Bakshi and George Stephanopoulos. Representation of Process Trends -- Part IV. Induction of Real-Time Patterns from Operating Data for Diagnosis and Supervisory Control. CCE, 18(4):303--332, 1994.
    Keywords: Decision Trees.
    Abstract: A methodology for pattern-based supervisory control and fault diagnosis is presented, based on the multi-scale extraction of trends from process data described in Part III of this series \cite{Bakshi:CCE:18:4a}. An explicit mapping is learned between the features extracted at multiple scales, and the corresponding process conditions, using the technique of induction by decision trees. Simple rules may be derived from the induced decision tree, to relate the relevant qualitative or quantitative features in the measured process data to process conditions. Industrial case studies from fine chemicals manufacturing, reactive crystallization and fed-batch fermentation are used to illustrate the characteristics of the pattern-based learning methodology and its application to process supervision and diagnosis.
  • Bhavik R. Bakshi and George Stephanopoulos. Representation of Process Trends -- Part III. Multiscale Extraction of Trends from Process Data. CCE, 18(4):267--302, 1994.
    Keywords: Wavelets, Multiscale Analysis.
    Abstract: This paper presents a formal methodology for the analysis of process signals and the automatic extraction of temporal features contained in a record of measured data. It is based on the multiscale analysis of the measured signals using wavelets, which allows the extraction of significant temporal features that are localized in the frequency domain, from segments of the record of measured data (i.e.\ localized in the time domain). The paper provides a concise framework for the multiscale extraction and description of temporal process trends. The resulting algorithms are analytically sound, computationally very efficient and can be easily integrated with a large variety of methods for the interpretation of process trends and the automatic learning of relationships between causes and symptoms in a dynamic environment. A series of examples illustrate the characteristics of the approach and outline its use in various settings for the solution of industrial problems.
  • Gerardo Beni and Xiaomin Liu. A Least Biased Fuzzy Clustering Method. TPAMI, 16(9):954--960, 1994.
    Keywords: Clustering, Cluster Validity Measures, Fuzzy Clustering, Multiscale Analysis.
    Abstract: A new operational definition of cluster is proposed, and a fuzzy clustering algorithm with minimal biases is formulated by making use of the Maximum Entropy Principle to maximize the entropy of the centroids with respect to the data points ({\sl clustering} entropy). We make no assumptions on the number of clusters or their initial positions. For each value of an adimensional scale parameter $\beta'$, the clustering algorithm makes each data point iterate towards one of the cluster's centroids, so that both hard and fuzzy partitions are obtained. Since the clustering algorithm can make a multiscale analysis of the given data set we can obtain both hierarchy and partitioning type clustering. The relative stability with respect to $\beta'$ of each cluster structure is defined as the measurement of cluster validity. We determine the specific value of $\beta'$ which corresponds to the optimal positions of cluster centroids by minimizing the entropy of the data points with respect to the centroids ({\sl clustered} entropy). Examples are given to show how this least-biased method succeeds in getting perceptually correct clustering results.
  • Stephen L. Chui. Fuzzy Model Identification based on cluster estimation. JIFS, 2:267--278, 1994.
    Keywords: Clustering, Fuzzy c-Means, Mountain Method, Fuzzy Models, Sequential/Temporal Data.
    Abstract: We present an efficient mountain method for estimating cluster centers of numerical data. This method can be used to determine the number of clusters and their initial values for initializing iterative optimization-based clustering algorithms such as fuzzy c-means. Here we use the cluster estimation method as the basis of a fast and robust algorithm for identifying fuzzy models. A benchmark problem involving the prediction of a chaotic time series shows this model identification method compares favourably with others, more computationally intensive methods. We also illustrate an application of this method in modeling the relationship between automobile trips and demographic factors.
  • Pau-Choo Chung, Ching-Tsorng Tsai, E-Liang Chen, and Yung-Nien Sun. Polygonal Approximation using a Competitive Hopfield Neural Network. PR, 27(11):1505--1512, 1994.
    Keywords: Neural Networks.
    Abstract: Polygonal approximation plays an important role in pattern recognition and computer vision. In this paper, a parallel method using a Competitive Hopfield Neural Network (CHNN) is proposed for polygonal approximation. Based on the CHNN, the polygonal approximation is regarded as a minimization of a criterion function which is defined as the arc-to-chord deviation between the curve and the polygon. The CHNN differs from the original Hopfield network in that a competitive winner-take-all mechanism is imposed. The winner-take-all mechanism adeptly precludes the necessity of determining the values for the weighting factors in the energy function in maintaining a feasible result. The proposed method is compared to several existing methods by the approximation error norms $L_2$ and $L_\infty$ with the result that promising approximation polygons are obtained.
  • Mohamed S. Kamel and Shokri Z. Selim. New Algorithms for Solving the Fuzzy Clustering Problem. PR, 27(3):421--428, 1994.
    Keywords: Clustering, Fuzzy Clustering, Fuzzy c-Means.
    Abstract: Two new algorithms for fuzzy clustering are presented. Convergence of the proposed algorithms is proved. An empirical study of their convergence behaviour is discussed. The performance of the new algorithms is compared with the fuzzy c-means algorithm by testing them on four published data sets. Experimental results show that the new algorithms are faster and lead to computational savings.
  • Yael Man and Isak Gath. Detection and Separation of Ring-Shaped Clusters Using Fuzzy Clustering. TPAMI, 16(8):855--861, 1994.
    Keywords: Clustering, Fuzzy Clustering, Image Data.
    Abstract: A new fuzzy clustering algorithm, designed to detect and characterize ring-shaped clusters and combinations of ring-shaped and compact spherical clusters, has been developed. This FKR algorithm includes automatic search for proper initial conditions in the two cases of concentric and excentric (intersected) combinations of clusters. Validity criteria based on total fuzzy area and fuzzy density are used to estimate the optimal number of substructures in the data set. The FKR algorithm has been tested on a variety of simulated combinations of ring-shaped and compact spherical clusters, and its performance proved to be very good, both in identifying the input shapes and in recovering the input parameters. Application of the FKR algorithm to an MRI image of the heart's left ventricle was aimed to investigate the possibility of using this algorithm as an aid im image processing.
  • Norman Ramsey. Literate programming simplified. IEEE Transactions on Software, 11(5):97--105, 1994.
    Keywords: Literate Programming.

Conference's articles

  • Rakesh Agrawal and Ramakrishnan Srikant. Fast Algorithms for Mining Association Rules. In VLDB94, Santiago, Chile, 1994.
    Keywords: Association Rules.
    Abstract: We consider the problem of discovering association rules between items in a large database of sales transactions. We present two new algorithms for solving this problem that are fundamentally different from the known algorithms. Empirical evaluation shows that these algorithms outperform the known algorithms by factors ranging from three for small problems to more than an order of magnitude for large problems. We also show how the best features of the two proposed algorithms can be combined into a hybrid algorithm, called AprioriHybrid. Scale-up experiments show that AprioriHybrid scales linearly with the number of transactions. AprioriHybrid also has excellent scale-up properties with respect to the transaction size and the number of items in the database.
  • William B. Cavnar and John M. Trenkle. N-Gram-Based Text Categorization. In Proceedings of SDAIR-94, 3rd Annual Symposium on Document Analysis and Information Retrieval, Las Vegas, US, pages 161--175, 1994. [ URL ]
  • Christos Faloutsos, M. Ranganathan, and Yannis Manolopoulos. Fast Subsequence Matching in Time-Series Databases. In MD94, 1994.
    Keywords: Sequential/Temporal Data, Speed-up Issues.
    Abstract: We present an efficient indexing method to locate 1-dimensional subsequences within a collection of sequences, such that the subseqeunces match a given (query) pattern within a specified tolerance. The idea is to map each data sequence into a small set of multidimensional rectangles in feature space. Then, these rectangles can be readily indexed using traditional spatial access methods, like the $R^*$-tree. In more detail, we use a sliding window over the data sequence and extract its features; the result is a trail in feature space. We propose an efficient and effective algorithm to divide such trails into sub-trails, which are subsequently represented by thei Minimum Bounding Rectangles (MBRs). We also examine queries of varying lengths, and we show how to handle each case efficiently. We implemented our method and carried out experiments on synthetic and real data (stock price movements). We compared the method to sequential scanning, which is the only obvious competitor. The results were excellent: our method accelerated the search time from 3 times up to 100 times.
  • Michael T. Goodrich. Efficient Piecewise-Linear Function Approximation Using the Uniform Metric. In SCG94, pages 322-331, 1994.
    Keywords: Piecewise Linear Representations.
    Abstract: We give an $O(n\log n)$-time method for finding a best k-link piecewise linear function approximating an n-point planar data set using the well-known uniform metric to measure the error, $\varepsilon\ge 0$, of the approximation. Our method is based upon new characterizations of such functions, which we exploit to design an efficient algorithm using a plane sweep in ``$\varepsilon$ space'' followed by several applications of the parametric searching technique. The previous best running time for this algorithm was $O(n^2)$.
  • Mika Klemettinen, Heikki Mannila, Prijo Ronkainen, Hannu Toivonen, and A. Inkeri Verkamo. Finding Interesting Rules from Large Sets of Discovered Association Rules. In CIKM94, pages 401--407, 1994.
    Keywords: Association Rules.
    Abstract: Association rules, introduced by Agrawal, Imielinski, and Swami, are rules of the form ``for 90\27777756214f the rows of the relation, if the row has value 1 in the columns in set W, then it has 1 also in column B''. Efficient methods exist for discovering association rules from large collections of data. The number of discovered rules can, however, be so large that browsing the rule set and finding interesting rules from it can be quite difficult for the user. We show how a simple formalism of rule templates makes it possible to easily describe the structure of interesting rules. We also give examples of visualization of rules, and show how a visualization tool interfaces with rule templates.
  • B. Uma Shankar and N.R. Pal. FFCM: An effective approach for large data sets. In Proceedings of the 3rd International Conference on Fuzzy Logic, Neural Nets and Soft Computing, Iizuka, Japan, pages 331--332, 1994.
    Keywords: Sampling, Clustering, Fuzzy c-Means, Speed-up Issues.
    Abstract: [Paper has no abstract; Summary:] To speed up FCM clustering a reduced data set is used, which is selected from the orginal data set by simple random sampling without replacement. After termination, further samples are added to the reduced data set and FCM starts again. If the prototypes of consecutive FCM calls do not differ very much, the ``FFCM'' process terminates.

Disclaimer

This list of publications is neither official nor complete, but a personal compilation.

Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright.

This document was translated from BibTEX by bibtex2html

Home © F. Höppner last update: Tue Dec 7 08:49:56 CET 2004