Similarity search optimization using recently-biased symbolic representation
نویسندگان
چکیده
منابع مشابه
Similarity search optimization using recently-biased symbolic representation
Dimension reduction is one of the important requirements for a successful representation to improve the efficiency of extracting the attracting trend patterns on the time series. Furthermore, an efficient and accurate similarity searching on a huge time series data set is a crucial problem in data mining preprocessing. Symbolic representations have proven to be a very effective way to reduce th...
متن کاملImage Similarity Using Symbolic Representation and Its Variations
This paper proposes a new method for image/object retrieval. A pre-processing technique is applied to describe the object, in one dimensional representation, as a pseudo time series. The proposed algorithm develops the modified versions of the SAX representation: applies an approach called Extended SAX (ESAX) in order to realize efficient and accurate discovering of important patterns, necessar...
متن کامل3D Similarity Search Using a Weighted Structural Histogram Representation
A fast and robust 3D retrieval method is proposed based on a novel weighted structural histogram representation. Our method has the following steps: 1) adaptively segment any 3D shape into a group of meaningful parts to generate local distribution matrixes, 2) integrate all the local distribution matrixes into a global distribution matrix, simultaneously considering their weight factors, and 3)...
متن کاملSymbolic Leaf Representation in Decoupled Search
Star-Topology Decoupled Search has recently been introduced in classical planning. It splits the planning task into a set of components whose dependencies take a star structure, where one center component interacts with possibly many leaf components. Here we address a weakness of decoupled search, namely large leaf components, whose state space is enumerated explicitly. We propose a symbolic re...
متن کاملRepresentation Independent Proximity and Similarity Search
Finding similar or strongly related entities in a graph database is a fundamental problem in data management and analytics with applications in similarity query processing, entity resolution, and pattern matching. Similarity search algorithms usually leverage the structural properties of the data graph to quantify the degree of similarity or relevance between entities. Nevertheless, the same in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Basic and Applied Sciences
سال: 2014
ISSN: 2227-5053
DOI: 10.14419/ijbas.v3i2.2358