#### Filter Results:

- Full text PDF available (11)

#### Publication Year

2008

2017

- This year (2)
- Last 5 years (27)
- Last 10 years (36)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Muhammad Marwan Muhammad Fuad
- DaWaK
- 2012

- Muhammad Marwan Muhammad Fuad
- IDEAS
- 2012

The differential evolution (DE) is a very powerful search method for solving many optimization problems. In this paper we present a new scheme (DESAX) based on the differential evolution to localize the breakpoints utilized with the symbolic aggregate approximation method; one of the most important symbolic representation techniques for times series data.… (More)

- Muhammad Marwan Muhammad Fuad
- AusDM
- 2012

The problem of similarity search is one of the main problems in computer science. This problem has many applications in text-retrieval, web search, computational biology, bioinformatics and others. Similarity between two data objects can be depicted using a similarity measure or a distance metric. There are numerous distance metrics in the literature, some… (More)

- Muhammad Marwan Muhammad Fuad
- ADMA
- 2012

Bio-inspired optimization algorithms have been gaining more popularity recently. One of the most important of these algorithms is particle swarm optimization (PSO). PSO is based on the collective intelligence of a swam of particles. Each particle explores a part of the search space looking for the optimal position and adjusts its position according to two… (More)

- Muhammad Marwan Muhammad Fuad
- ADMA
- 2012

The normalized edit distance is one of the distances derived from the edit distance. It is useful in some applications because it takes into account the lengths of the two strings compared. The normalized edit distance is not defined in terms of edit operations but rather in terms of the edit path. In this paper we propose a new derivative of the edit… (More)

Similarity search is an important problem in information retrieval. This similarity is based on a distance. Symbolic representation of time series has attracted many researchers recently, since it reduces the dimensionality of these high dimensional data objects. We propose a new distance metric that is applied to symbolic data objects and we test it on… (More)

- Muhammad Marwan Muhammad Fuad, Pierre-François Marteau
- Infoscale
- 2008

Similarity search is a fundamental problem in information technology. The main difficulty of this problem is the high dimensionality of the data objects. In large time series databases, it’s important to reduce the dimensionality of these data objects, so that we can manage them. Symbolic representation is a promising technique of dimensionality reduction.… (More)

We propose a new multi-resolution indexing and retrieval method of the similarity search problem in time series databases. The proposed method is based on a fast-and-dirty filtering scheme that iteratively reduces the search space using several resolution levels. For each resolution level the time series are approximated by an appropriate function. The… (More)