matching

问题 I need help with taking the following data which is organized in a large matrix and averaging all of the values that have a matching ID (index) and outputting another matrix with just the ID and the averaged value that trail it. File with data format: (This is the StarData variable) ID>>>>Values 002141865 3.867144e-03 742.000000 0.001121 16.155089 6.297494 0.001677 002141865 5.429278e-03 1940.000000 0.000477 16.583748 11.945627 0.001622 002141865 4.360715e-03 1897.000000 0.000667 16.863406 13

问题 imagine that we use pagination to split and display a mysql result like this, sorted on auto inceremental ID and date: SELECT name FROM members ORDER BY id DESC, date DESC LIMIT $start, $len we display that result and page navigation links below it using php. how we can find that record ID number x is in which page of that result so we set page number to that page and display that page and end-user do not need to click navigation and find it? 回答1: First get total number of records. select

问题 I decided to write some common Higher Order Functions in Java (map, filter, reduce, etc.) that are type safe via generics, and I'm having problems with wildcards matching in one particular function. Just to be complete, the functor interface is this: /** * The interface containing the method used to map a sequence into another. * @param <S> The type of the elements in the source sequence. * @param <R> The type of the elements in the destination sequence. */ public interface Transformation<S,

问题 I know this question have been asked a lot of time. I want a suggestion on which algorithm is suitable for approximate string matching. The application is specifically for company name matching only and nothing else. The biggest challenge is probably the company end name part and short named part Example: 1. companyA pty ltd vs companyA pty. ltd. vs companyA 2. WES Engineering vs W.E.S. Engineering (extremely rare occurance) Do you think Levenshtein Edit Distance is adequate? I'm using C#

问题 This question already has answers here : matching all characters in any order in regex (3 answers) Closed 5 years ago . I have a chunk of words, all of which are valid English words I'm going to query with RegExp. What I need is to match words which contains the letters of a specified word in any order. Example (A segment): ... peloton pelt pelta peltae peltast .... I should be able to fill in a regex for "leap" and collect "pelta", "peltae" and "peltast" along with other words within the

问题 I have 2 matrices A = [66 1 29.2; 80 0 29.4; 80 0 29.4; 79 1 25.6]; B = [66 1 28.2; 79 0 28.4; 66 1 27.6; 80 0 22.4] I would like to find the indeces of the matching rows. indx = [1 1; 2 4; 3 2; 4 3] idx means that row1 of A matches with row1 of B, row2 of A with row4 of B etc. It should be a pairwise matching (1 row of A with only 1 row of B) For the values in column 2 it should be a strict match. For the values of columns 1 and 3 it should be the best match..(i.e. if it exist a pair with

问题 i am relatively new to r, so any help is appreciated sample dataset, also attached an image of the dataset. image is of sample dataset a B C D 12.97221, 64.78909 1 2 69.64817, 321.90037 2 28 318.87946, 259.29946 3 5 326.17622, 94.7089 9 8 137.54006, 325.34917 5 88 258.06002, 94.77531 6 63 258.92824, 322.20164 7 64 98.57514, 12.96828 8 34 98.46303, 139.27264 9 21 317.22764, 261.25563 10 97 my Goal: i need to 1) look at value in column A 2) find the nearest/closest number in column B 3) test to

问题 Problem: I have two strings, say, "Billie Jean" and "Thriller". I need to programmatically compare them and find how closely they are related. Those are both songs of the same artist, hence, they should give a higher score (probability, percentage etc) than say, "Brad Pitt" and "Jamaican Farewell". One way of doing this is an open source Java tool named WikipediaMiner which compares using the Wikipedia data dump, checking links, descriptions etc. Question: Please suggest a better alternative,

问题 So following the example from the Matching package and in particular the GenMatch example Link to package here Following the example in GenMatch library(Matching) data(lalonde) attach(lalonde) X = cbind(age, educ, black, hisp, married, nodegr, u74, u75, re75, re74) BalanceMat <- cbind(age, educ, black, hisp, married, nodegr, u74, u75, re75, re74, I(re74*re75)) genout <- GenMatch(Tr=treat, X=X, BalanceMatrix=BalanceMat, estimand="ATE", M=1, pop.size=16, max.generations=10, wait.generations=1)

问题 Problem: I want to suggest the top 10 most compatible matches for a particular user, by comparing his/her 'interests' with interests of all others. I'm building an undirected weighted graph between users, where the weight = match score between the two users. I already have a set of N users: S. For any user U in S, I have a set of interests I. After a long time (a week?) I create a new user U with a set of interests and add it to S. To generate a graph for this new user, I'm comparing interest