Best Match Algorithm

Who will explain me best match algorithm for finding an attribute value in a table

From what you wrote I would say:
SELECT <WhateverYouWant> FROM <WhereverItIs>
WHERE <TheAttribute> = <TheCriterion>
So: '=' seems to be the best match 'algorithm' you can use.
If I misunderstood your requirement, please elaborate.

Similar Messages

  • Use of edge detection in pattern matching algorithm?

    Hello all,
                    I work for a group at Texas A&M University researching two-phase flow in reactors.  We have been using IMAQ Vision and had a question regarding the use of edge detection in the pattern matching algorithm.  I had seen the webcast entitled “Algorithms that Learn: The Sum and Substance of Pattern Matching and OCR” (http://zone.ni.com/wv/app/doc/p/id/wv-705) and in the webcast it was mentioned that the pattern matching algorithm uses edge detection to, (as best I can tell), reduce the candidate list further and to perform subpixel location calculations.  However, I was wondering if this edge detection process is still performed if we do not use the subpixel location calculation (i.e. if we uncheck the “Subpixel Accuracy” check box)?  Also, if edge detection is performed in the pattern matching algorithm is it consistent with the method described in Chapter 13 of the Vison Concepts Manual (“Geometric Matching”)?  Finally, if edge detection is performed in a manner consistent with Chapter 13 of the manual, how does the geometric matching correlation number affect the correlation calculation that was performed in the previous steps?  Are they simply multiplied together?
    Many thanks!
      -Aaron

    Jeff,
    We are using Imaq Vision Builder 4, with the included pattern matching that can be accessed via the menus (i.e. we haven't created a custom VI or anything.)  We are using the software to locate bubbles during boiling experiments and want a deeper understanding of what is going on "behind the scenes" of the algorithm, as we may have to explain how it works later.  We have been able to determine most of what we need from the webcast I had previously mentioned, except for the use of edge detection in the pattern matching algorithm.
    At the scales involved in our experiments, subpixel accuracy is really not needed and therefore we do not use it.  If edge detection is used in the pattern matching algorithm only to determine location with subpixel accuracy, then we do not really need to know how it works because we do not use that calculation.  Inversely, of course, if edge detection is used during pattern matching even without enabling subpixel accuracy, then we would like to have a fairly good understanding of the process.
    I've read most of the section on geometric matching in the Vision Concepts Manual and wondered if the process described there for edge detection (or feature matching) was also used in the basic pattern matching algorithm?
    To summarize, if edge detection is not used in the basic pattern matching algorithm without subpixel accuracy, then that is all I need to know.  If edge detection is used for pattern matching even without using the subpixel accuracy calculation, then we would like to learn more about how exactly it is used in the pattern matching algorithm.
    We would really appreciate any help you could give us... we've been digging around on the NI website for a couple of weeks now trying to fit together all the pieces of the pattern matching puzzle.
    Many thanks!
        Aaron

  • The best compression algorithm to use

    Hello Suners,
    I have a 7 GB file and i need to compress it to be 2 GB at most in order to upload it and download it faster.
    What is the best compression algorithm to use in this case? can i get the desired size and if i do how could i decompress it?

    abulseed wrote:
    OK,
    in fact it's not just a one file it's a folder containing number of files with different types the total size of them is 7GB,
    is there an algorithm can compress that folder to at most 2GB and if there one give me a link.You seem to be missing the point that it's the actual data in the files that matters for compression. A 7 GB file consisting of the words "Hello World" over and over again will compress quite significantly. A 7GB image file on the other hand will not compress hardly at all.
    Take the java.util.zip package read [http://java.sun.com/developer/technicalArticles/Programming/compression/] and try for yourself with your data. If you are hoping to compress unknown data from 7Gb to 2GB the answer is that that promise is impossible to make.

  • Which sony HD camcorder best matches with Mac OS and its software?

    HI. Everyone. Which sony HD camcorder best matches with Mac OS and its software?
    Thanks.

    There may be a better forum to ask this question in -- not all Keynote users have Sony HD camcorders.

  • Matching algorithm problem

    Hello everyone!!
    I have been trying to find the JAVA implementation for this algorithm forever!
    It is called: the maximum weighted bipartite matching algorithm or the maximum weighted cardinality bipartite matching algorithm.
    If anyone knows how I could find its JAVA implementation, I would be grateful!!
    Thank you in advanc,
    gispider!

    Have you tried google?
    http://www.google.co.uk/search?q=java+maximum+weighted+cardinality+bipartite+matching+algorithm

  • Best Compression algorithm ?

    which is the best compression algorithm in the world ? And wht is the compression ratio for this algo?
    namanc

    How much wood would a wood chuck chuck if a wood chuck could chuck wood?

  • Best matched video card to system

    Is the PNY Geforce 4 5200 Ultra the best match video card for my system? I am not real brand specific on this, any input would be appericated.
    thanks
    justin
    MSI K7N2 DELTA
    AMD 2500 BARTON 333MHZ FSB
    1 G DDR 400 KINGSTON DUEL CHANNEL
    ANTEC SUPER LANBOY
    ENLIGHT 420WATT P.S.
       +5 V 40A, +3.3V 30A, +12V 18A
    WINDOWS XP
    PNY GEFORCE 4 5200 ULTRA

    jjscram,
    GeForceFX 5700 Ultra or ATI All in Wonder 9600Pro. They are best bang for the buck and you will love their performance and features.  
    Take Care,
    Richard

  • Tsql query to Lookup Prefix based best match help

    Hi All
    I have some raw data to be processed and I have no idea how to do look up based on the prefix to find the best match.
    There are 2 tables Area and Customer
    I need to match the Customer ID with the leading Prefix on the area Table to find the best match.
    Eg: mark on Customer table has Id: 1234908974 which has the only possible match for 1234 - London on the Area table.
    I need an output table like below.
    Thanks a lot in advance.
    create TABLE Customer (Name Varchar(20), CustomerID int)
    GO
    -- Inserting Data into Table
    INSERT INTO Customer (Name,CustomerID) VALUES('John','1234501111')
    INSERT INTO Customer (Name,CustomerID) VALUES('Mat','1234109874')
    INSERT INTO Customer (Name,CustomerID) VALUES('Sam','1234207485')
    INSERT INTO Customer (Name,CustomerID) VALUES('Jake','1234205241')
    INSERT INTO Customer (Name,CustomerID) VALUES('Daniel','1234309632')
    INSERT INTO Customer (Name,CustomerID) VALUES('Mark','1234908974')
    Go
    create TABLE Area (Prefix int, Area Varchar(20))
    GO
    INSERT INTO Area (Prefix, Area ) VALUES('1234','London')
    INSERT INTO Area (Prefix, Area ) VALUES('123410','Manchester')
    INSERT INTO Area (Prefix, Area ) VALUES('123420','York')
    INSERT INTO Area (Prefix, Area ) VALUES('123430','Cardiff')
    INSERT INTO Area (Prefix, Area ) VALUES('123440','Bath')
    INSERT INTO Area (Prefix, Area ) VALUES('123450','Berby')
    Go

    Try
    USE tempdb
    CREATE TABLE Customer (
    NAME VARCHAR(20)
    ,CustomerID INT
    GO
    -- Inserting Data into Table
    INSERT INTO Customer (
    NAME
    ,CustomerID
    VALUES (
    'John'
    ,'1234501111'
    INSERT INTO Customer (
    NAME
    ,CustomerID
    VALUES (
    'Mat'
    ,'1234109874'
    INSERT INTO Customer (
    NAME
    ,CustomerID
    VALUES (
    'Sam'
    ,'1234207485'
    INSERT INTO Customer (
    NAME
    ,CustomerID
    VALUES (
    'Jake'
    ,'1234205241'
    INSERT INTO Customer (
    NAME
    ,CustomerID
    VALUES (
    'Daniel'
    ,'1234309632'
    INSERT INTO Customer (
    NAME
    ,CustomerID
    VALUES (
    'Mark'
    ,'1234908974'
    GO
    CREATE TABLE Area (
    Prefix INT
    ,Area VARCHAR(20)
    GO
    INSERT INTO Area (
    Prefix
    ,Area
    VALUES (
    '1234'
    ,'London'
    INSERT INTO Area (
    Prefix
    ,Area
    VALUES (
    '123410'
    ,'Manchester'
    INSERT INTO Area (
    Prefix
    ,Area
    VALUES (
    '123420'
    ,'York'
    INSERT INTO Area (
    Prefix
    ,Area
    VALUES (
    '123430'
    ,'Cardiff'
    INSERT INTO Area (
    Prefix
    ,Area
    VALUES (
    '123440'
    ,'Bath'
    INSERT INTO Area (
    Prefix
    ,Area
    VALUES (
    '123450'
    ,'Derby'
    GO
    WITH cte
    AS (
    SELECT C.*
    ,P.*
    ,ROW_NUMBER() OVER (
    PARTITION BY C.CustomerID ORDER BY len(cast(P.Prefix AS VARCHAR(20))) DESC
    ) AS Rn
    FROM Customer C
    INNER JOIN Area P ON CAST(C.CustomerID AS VARCHAR(20)) LIKE CAST(P.Prefix AS VARCHAR(20)) + '%'
    SELECT *
    FROM cte
    WHERE Rn = 1
    ORDER BY CustomerID;
    BTW, I would suggest to use varchar columns instead of integer to avoid conversions.
    For every expert, there is an equal and opposite expert. - Becker's Law
    My blog
    My TechNet articles
    This is better solution so far!

  • Two ( *.wav , *.mp3)Sound Compare or sound Matching Algorithm

    Hi all,
    I am a windows developer , where as i am developing a apps for sound comparison . Here , In this apps i have one audio sound in database , and another sound we are capturing from MIC , and going to compare. But i want to resolve the problem if another music
    file having noise , so i need to extract the noise and then going for compare the two music. After that we can make the decision that , how much percent the sound is match.
    Thank u
    [email protected]

    You should defenitaly take a look at :
    http://jsresources.sourceforge.net/
    and of course the java sound tutorial at:
    http://java.sun.com/docs/books/tutorial/sound/index.html
    JSResources is one of the best sites for Java Sound I know,
    it contains lots of useful examples and the FAQ section is also very handy for do's and dont's and how's :-)

  • Jaro-Winkler Matching Algorithm

    Does anyone know where to get the source for this algorithm?
    I've searched on the web, but there's nothing but science papers on the algorithm. I'm an average joe and some of the stuff in them science papers goes well over me head
    So if any one has it could ya lend us a hand and pass it on, please.
    Even if you have it in a different language it will be fine.
    Thanks,
    Thomas

    i read something about this algorithm and i will try to explain, how i understood it. perhaps it will help you.
    well the algorithm determines how similar two strings are and return a value between 0.0 (strings completely don't match)and 1.0 (strings completely match).
    this value is calculatable with this formula:
    ��*(commons/LengthOfString1 + commons / LengthOfString2 + transpositions / commons).
    you see it is very important to know what commons and transpositions are. i will try to explain (my english is not very good:-)).
    commons are the amount of letters both of the strings have in common. but these letters must not have exactly the same position, but the fitting letter must be in an interval that is maximal half of the length of the shorter string.an example the strings are "Jonos" and "Johnson".the length of the the shorter string is 5. half of this length is rounded to 2. well if you consider the third letter of "Jonos". the n have to be in the interval (3-LengthOfShorterString,3+LengthOfShorterString)=(1,5) of "Johnson".
    see: http://www.wiwiss.fu-berlin.de/lenz/winfo/download/seminar/StringcomparisonTechniken.pdf !!
    well it is german but there are images which explain what commons and transpositions are. see the bottom of page 13 (beispiel 9=example 9) and page 14. the amount of connected lines is the value for commons.
    the transpositions:
    transpositions=commons-(amount of crossing lines -the amount of crossing bundles)
    well i hope this will help you!
    regards
    iwon

  • Fingerprint matching algorithm.....

    Hello i want to make one algorithm which can compare two finger prints. Can anyone please help which would be helpful. I have studied JAI API but it is too large to learn. I am having academic requirement for this project so that i need some to the point help which can satisfy my current requirement...
    Any Comment will be very helpful to me..
    Thanks .....

    Your question is confusing.
    There are two steps
    1. Find one or more algorithms to implement pattern matching and perhaps more specifically finger prints.
    2. Implement those using a language.
    You do not do step 2 until you have completed step 1. And the JAI API could only be used with step 2.

  • Best sorting algorithm

    What would be the best sorting to algorithm for a list that is probably 90% sorted? I assume that quick sort wouldn't be the most efficient in this case.
    EDIT: the list is made of strings. So i don't think any of the linear sorts will work.
    Also, what sorting algorithm does Collections.sort() use?

    Quote from the javadocs:
    The sorting algorithm is a modified mergesort (in which the merge is omitted if the highest element in the low sublist is less than the lowest element in the high sublist). This algorithm offers guaranteed n log(n) performance.
    http://java.sun.com/javase/6/docs/api/java/util/Collections.html#sort(java.util.List)

  • Best Fit Algorithm

    Hi,
    My problem is as follows:
    I have a bunch of files that I would like to copy to a CD. The total size of these files let's say needs four to five CD's, depending on the way that you arrange the files. I need an algorithm that takes the sized of these files, and distribute them on the Maximum capacity of each CD, in a way to utilize the space of each CD.
    Example:
    Let's say a CD can contain 20 MB.
    items:
    (A) 10
    (B) 5
    (C) 4
    (D) 3
    (E) 2
    if you sort the files based on their size - like above - most likely you'll choose the files as follows:
    (A) 10, (B) 5, (C) 4, the total will be 19 MB and there will be 1 MB unused.
    However, if you replace (C) with (D) and (E), you'll fill the remaining unused space efficiently.
    Of course, this example is very easy to solve manually with a glance. But in case of more complicated scenarios with many files with different sizes, that task will be much harder.
    So, any help :)

    Thanks a lot, it was really close, but what I actually needed was this:
    [http://en.wikipedia.org/wiki/Bin_packing_problem|Bin Packing Problem]
    I found many project in the Source Forge about it.
    [http://sourceforge.net/search/?type_of_search=soft&type_of_search=soft&words=Bin+Packing+Problem|Source Forge Projects]

  • How to identify the best match Business Content CUBEs

    Hi Experts
    I got the reporting requirments from the user...
    How can i identify is there any suitable business content bw objects (Data Source,DSO,Cube..etc) avaliable that i can use to meet the requirment or
    alteast find a nearst match so that i can enhance
    Please advise me how to start
    Thanks

    Hi,
    Once you collected requirements then you can take a look at the business content site for the datasources or cubes etc.which fit with your requirements.If you tell your requirements then we can suggest you what to use or you can start taking a look at  the link below.
    http://help.sap.com/saphelp_nw70/helpdata/en/3d/5fb13cd0500255e10000000a114084/frameset.htm
    Regards.

  • Closest Match algorithm using Strings..

    Hi all,
    I am wondering if there is any built in mechanism, or if not, any thought on how to get find a "close" match in a list of Strings, given a String and a set number of characters to match from the start of the String. Basically I have a combo box of items, and the user selects a file with "source" items. I try to display the "closest" match, if possible, if not an exact match, by looping through the x number of characters and so forth. With this being a JDK 1.4 application, I am curious to know if it is possible to do this using Regular Expressions, and if so, how would it be done? I haven't figured out Reg Expressions at this point. My immediate need is up to 3 characters matching, so in a name list of Jody, John, and Johnson, with a String of Joh, the John item would be returned as the closest match. If the String is ABC given the same list, then nothing is returned. It must be at least the first character matching, otherwise null is returned.
    Thanks for any help.

    Thanks. I'll look it up. I actually got it somewhat working. I basically have a list of items. I pass that list with the specific character and position of that character to match. It returns a List of all items that have the passed in character at the specific position. I then do it again for the next character, in a loop. In my case, I am only looking for the first 3 characters to be a match. That gets us a "close enough" situation where the user can then try to pick from there.
    Thanks for your input.

Maybe you are looking for