• No results found

Search on the Partition Space

Bayesian clustering of curves and the search of the partition space

Bayesian clustering of curves and the search of the partition space

... the search space need not only to be parsimonious so that they can be estimated and scored at speed, utilising properties of conjugacy, but will also need to mirror closely the types of regulatory ...

220

Searching a multivariate partition space using weighted MAX SAT

Searching a multivariate partition space using weighted MAX SAT

... comprehensive search for the highest scoring (MAP) partition is usually ...dom search algorithms traverse only a small pro- portion of partitions of a large ...factor search on partitions as a ...

9

Restricting Supervised Learning:Feature Selection and Feature Space Partition

Restricting Supervised Learning:Feature Selection and Feature Space Partition

... have all possible data or behaviors given (or labelled), the inferred function must generalize from the training data to unseen data. Supervised learning is used in many areas, for example bioinformatics, cheminformatics ...

121

Bi-Parameter Space Partition for Cost-Sensitive SVM

Bi-Parameter Space Partition for Cost-Sensitive SVM

... bi-parameter space partition algorithm for CS-SVM which can fit all solutions for each parameter pair (C + , C − ...the space partition, a K-fold cross val- idation algorithm was proposed ...

8

Tree Based Space Partition of Trajectory Pattern Mining For Frequent Item Sets

Tree Based Space Partition of Trajectory Pattern Mining For Frequent Item Sets

... based search 4. Vague Space Partition The flow diagram of proposed method is shown in ...Vague Space Partition (VSP) algorithm which performs scanning ...vague space ...

12

GPH: Similarity Search in Hamming Space

GPH: Similarity Search in Hamming Space

... a partition, meaning that at least 1/10 data vectors become candidates if the query matches the data vector on this ...distance search problem and address the above- mentioned ...each partition is a ...

15

Which Space Partitioning Tree to Use for Search?

Which Space Partitioning Tree to Use for Search?

... Binary space-partitioning trees. We establish search performance guarantees for BSP-trees by linking their nearest-neighbor perfor- mance to their vector quantization performance and utilizing the recent ...

11

Reduction of Search Space in Restful Service Discovery

Reduction of Search Space in Restful Service Discovery

... and it is more is more alike than those other categories. K means Clustering algorithm is a useful method to identify the outlines of their services in the variable k. They define the outer as an element of the service ...

10

Fast £1-norm Nearest Neighbor Search Using A Simple Variant of Randomized Partition Tree

Fast £1-norm Nearest Neighbor Search Using A Simple Variant of Randomized Partition Tree

... linear search while large val- ues of k resulted in small number of retrieved points however, yielding a poor nearest neighbor search ...neighbor search problems, where in every problem instance, ...

10

Efficient solution of many instances of a simulation-based optimization problem utilizing a partition of the decision space

Efficient solution of many instances of a simulation-based optimization problem utilizing a partition of the decision space

... Increasingly complex engineering optimization problems are modeled and solved, due to the increased possibility to use numerical simulations (such as, e.g., finite elements methods for structural analysis and ...

27

How To Find The Partition Complexity Of A Binary Space Partition

How To Find The Partition Complexity Of A Binary Space Partition

... binary space partition tree is a geometric data structure obtained by a recursive partitioning scheme, called binary space partition (for short, BSP) over a set of input objects: The ...

28

Learning Grammars for Different Parsing Tasks by Partition Search

Learning Grammars for Different Parsing Tasks by Partition Search

... ????????? ?? ?????????????????????????? ?!?????"?$#&%'?????( )? ?+*,??? /??021 %'??? #? 3#? ???546??????798 <;>=@?BADC>EGF HJI/K/H LNM(OQPSR@T?UVOQWJX

7

Generalised partition functions: inferences on phase space distributions

Generalised partition functions: inferences on phase space distributions

... For κ 6= ∞ these are subject to the restrictions that they can be used only at temperatures far from zero. They thus, as shown earlier, have little value for quantum physics. This is reasonable, because physical κ ...

8

Add Disk Space to a VM when a Partition is Full

Add Disk Space to a VM when a Partition is Full

... add space and decide how much Section 2 − Check for available unallocated space in the volume group Section 3 − Check to see if there is enough available space in the datastore Section 4 − Use Free ...

14

SEARCH METHODS IN AI STATE SPACE SEARCH

SEARCH METHODS IN AI STATE SPACE SEARCH

... 3. [Goal Test] If n is Goal, then decide on Termination or Continuation / Cost Updation 4. n_k, of node n, based on the State Transformation Rules. b) Put n in LIST CLOSED[r] ...

28

Multilevel Thresholding based on Fuzzy C Partition and Gravitational Search Algorithm

Multilevel Thresholding based on Fuzzy C Partition and Gravitational Search Algorithm

... (Received March 6th, 2014 / Accepted April 30th, 2014) 1 Introduction Image segmentation is an important processing stage in image, video and computer vision application. It is an image analysis step in which input are ...

11

Space-Efficient Finger Search on Degree-Balanced Search Trees

Space-Efficient Finger Search on Degree-Balanced Search Trees

... degree-balanced search tree is intuitive because all of the leaves are at the same depth and so the left-right spine of x has the same length as the right-left ...

10

The Shape of Evolutionary Search: Discovering and Representing Search Space Structure

The Shape of Evolutionary Search: Discovering and Representing Search Space Structure

... The other goal was to find evidence that using more levels than two can be useful. To achieve this goal several values of level ( 2, 3, 5 and 10) were examined with the maximal species number fixed to 20. The experiments ...

155

SAT-Encodings, Search Space Structure, and Local Search Performance

SAT-Encodings, Search Space Structure, and Local Search Performance

... duced search spaces and SLS ...local search algorithms like ...the search space (as measured by the standard deviation of the objective function) or the lo- cal minima ...
CLASSIFICATION TO ORDINAL CATEGORIES USING A SEARCH PARTITION METHODOLOGY WITH AN APPLICATION IN DIABETES SCREENING

CLASSIFICATION TO ORDINAL CATEGORIES USING A SEARCH PARTITION METHODOLOGY WITH AN APPLICATION IN DIABETES SCREENING

... ROGER J. MARSHALL* Department of Community Health, University of Auckland, Private Bag 92019, Auckland, New Zealand SUMMARY A method is proposed for classi"cation to ordinal categories by applying the search ...

13

Show all 10000 documents...

Related subjects