Frequency mining problem comprises the core of several data mining algorithms. Among frequent pattern discovery algorithms, FP-GROWTH employs a unique search strategy using compact structures resulting in a high performance algorithm that requires only two database passes. We introduce an enhanced version of this algorithm called FP-GROWTH-TINY which can mine larger databases due to a space opt...

Whenever a database permits textual entry of information | for example when data is copied from a paper form | the database is likely to contain duplicates and inconsistencies. These duplicates must be removed and inconsistencies resolved in order to mine the data or to use the data for decision support. We term the domain-speci c solution to duplicate and inconsistency removal data standardiza...

the present research has been carried out to study the structure of indexing language databases of irandoc. three databases have been selected as a sample: iranian dissertation abstracts. directory of scientific meetings held in iran. current research in iranian universities and research centers. some descriptors have been selected as a sample for study. to analyze the descriptors checklist was...

An elementary proof of a basic uncertainty principle concerning pairs of representations of <N vectors in different orthonormal bases is provided. The result, slightly stronger than stated before, has a direct impact on the uniqueness property of the sparse representation of such vectors using pairs of orthonormal bases as overcomplete dictionaries. The main contribution in this paper is the im...

Data mining is a collection of techniques used to extract useful information from large data bases. Data clustering is a popular data mining technique. It is the task of grouping a set of objects into classes such that similar objects are placed in the same cluster while dissimilar objects are in separate clusters. Fuzzy cmeans (FCM) is one of the most popular clustering algorithms. However, it...

An elementary proof of a basic uncertainty principle concerning pairs of representations of vectors in different orthonormal bases is provided. The result, slightly stronger than stated before, has a direct impact on the uniqueness property of the sparse representation of such vectors using pairs of orthonormal bases as overcomplete dictionaries. The main contribution in this paper is the impro...

This chapter describes the separation mechanisms used for DNA electrophoresis. The focus is on the concepts that may help the researcher understand the methodology, read the theoretical literature, analyze experimental data, identify the relevant separation regimes, and/or design optimization strategies. But first, let’s look at some key definitions. Since capillary electrophoresis (CE) is a “f...

The purpose of this correspondence is to generalize a result by Donoho and Huo and Elad and Bruckstein on sparse representations of signals in a union of two orthonormal bases for . We consider general (redundant) dictionaries for , and derive sufficient conditions for having uniquesparserepresentations of signals insuchdictionaries.Thespecial case where the dictionary is given by the union of ...

An elementary proof of a basic uncertainty principle concerning pairs of representations of RN vectors in different orthonormal bases is provided. The result, slightly stronger than stated before, has a direct impact on the uniqueness property of the sparse representation of such vectors using pairs of orthonormal bases as overcomplete dictionaries. The main contribution in this paper is the im...

An elementary proof of a basic uncertainty principle concerning pairs of representations of WN vectors in different orthonormal bases is provided. The result, slightly stronger than stated before, has a direct impact on the uniqueness property of the sparse representation of such vectors using pairs of orthonormal bases as overcomplete dictionaries. The main contribution in this paper is the im...