Energy simulation tool is a tool to simulate energy use by a building prior to the erection of the building. Commonly it has a feature providing alternative designs that are better than the user’s design. In this paper, we propose a novel method in searching alternative design that is by using classification method. The classifiers we use are Naïve Bayes, Decision Tree, and k-Nearest Neighbor. ...

Given a set S of n sites (points), and a distance measure d, the nearest neighbor searching problem is to build a data structure so that given a query point q, the site nearest to q can be found quickly. This paper gives a data structure for this problem; the data structure is built using the distance function as a “black box”. The structure is able to speed up nearest neighbor searching in a v...

A topic of growing interest in a wide range of domains is the similarity of data entries. Data sets of genome sequences, text corpora, complex production information, and multimedia content are typically large and unstructured, and it is expensive to compute similarities in them. The only common denominator a data structure for eicient similarity search can rely on are the metric axioms. One su...

Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these points into a data structure, so that given a query point, the nearest data point to the query point can be reported efficiently. Because data sets can be quite large, we are primarily interested in data structures that use only O...

In this paper, a new inequality is derived which can be used for the problem of nearest neighbor searching. We also present a searching technique referred to as a previous medoid index to reduce the computation time particularly for the kmedoids-based algorithms. A novel method is also proposed to reduce the computational complexity by the utilization of memory. Four new search strategies for k...

Search engine is fundamentally a framework used to search the data which is pertinent to the client via WWW. Looking close-by spot identified with the keywords is an imperative concept in developing web advances. For such kind of searching, extent pursuit or closest neighbor is utilized. In range search the forecast is made whether the objects meet to query object. Nearest neighbor is the forec...

We consider the subset query problem, defined as follows: given a set P of N subsets of a universe U , |U | = m, build a data structure, which for any query set Q ⊂ U detects if there is any P ∈ P such that Q ⊂ P . This is essentially equivalent to the partial match problem and is a fundamental problem in many areas. In this paper we present the first (to our knowledge) algorithms, which achiev...

An Intelligent RAM for Nearest Neighbor Database Searching Aaron Lipman and Woodward Yang Abstract The nearest neighbor algorithm is well suited to an IRAM implementation, given its high bandwidth requirement between memory and processing. We have designed and implemented the Smart Access Memory (SAM) chip to retrieve the k nearest neighbors to a query point in a database of example data vector...