search for: proximities

Ein eingebundener Text mit undefiniertem Zeichensatz wurde abgetrennt. Name: nicht verf?gbar URL: <https://stat.ethz.ch/pipermail/r-help/attachments/20120201/cc22025d/attachment.pl>

Hello all, I've been pouring through the various spatial packages, but haven't come across the right thing yet. Given a set of points in 2-d space X, i'm trying to find the subset of points in Y proximate to each point in X. Furthermore, the proximity threshold of each point in X differs (X$threshold). I've constructed this myself already, but it's horrificly slow with a

Greetings R Users! I am posting to inquire about the proximity matrix in the randomForest R-package. I am having difficulty pushing very large data through the algorithm and it appears to hang on the building of the prox matrix. I have read on Dr. Breiman's website that in the original code a choice can be made between using an N x N matrix OR to increase the ability to compute large

On Tue, Dec 03, 2019 at 07:01:36PM -0800, Jacob Pan (Jun) wrote: > Hi Jean, > > Sorry for the delay, I was out last week. Comments inline below. > > On Mon, 25 Nov 2019 19:02:47 +0100 > Jean-Philippe Brucker <jean-philippe at linaro.org> wrote: > > > On Fri, Nov 22, 2019 at 04:01:02PM -0800, Jacob Pan (Jun) wrote: > > > > (1) ACPI has one table per

Hi, I was reading an article recently about how google ranks results (among many other things of course) based on the proximity of the search terms in the source documents. In addition, the position of the search terms in the search query string itself is also taken into consideration when determining how important each term is. Does Xapian do something similar - at least for the first part?

Does anyone know where I might be able to download/purchase a database of US cities and their longitude/latitude coordinates? I''d like to provide a search option on a website that allows users to search by city but include cities in the surrounding area. Thanks, Carl Youngblood _______________________________________________ Rails mailing list

Lucene has a syntax "foo bar"~10 for finding foo within 10 words of bar. Does ferret support this feature? (the ~ is used for fuzzy queries) Does rdig? This could be a deal breaker for me ''cos I really need proximity searches -- Posted via http://www.ruby-forum.com/.

Hi, Can anyone tell me if the Motorola Q has its Bluetooth always on like the IPhone? I want to use the Motorola Q in a Proximity Detection setup like that described on nerdvittles.com. I know the Treo 650 does not work well since the display must be on for the bluetooth to be on and this eats power. Thanks Chuck Bunn

hello, I want to use randomForest to classify a matrix which is 331030?42,the last column is class signal.I use ? Memebers.rf<-randomForest(class~.,data=Memebers,proximity=TRUE,mtry=6,ntree=200) which told me" the error is matrix(0,n,n) set too elements" then I use: Memebers.rf<-randomForest(class~.,data=Memebers,importance=TRUE,proximity=TRUE) which told me"the error is

...to which proportion mtry/nvariables it makes sense to increase mtry without "overtuning" RF. Let me tell my example: I have 106 spectra belonging to 4 classes, the number of variables is 172. I'm interested in finding information about variables (importance, split points etc.) and proximities. First I ran a forest with mtry =30 and ntree=2500. The result was an oob-estimate of overall error rate of zero, perfect classification. In order to explore my results, I calculated the average proximity between the classes. I got: > res op12 op13 op14...

I'm using an SVM as I've seen a paper that reported extremely good results. I'm not having such luck. I'm also interested in ideas for other approaches to the problem that can also be applied to general problems (no assuming that we're looking for spirals). Here is my code: library(mlbench) library(e1071) raw <- mlbench.spirals(194, 2) spiral <-

Hello, I am struggling to produce an MDS plot using the randomForest package with a moderately large data set. My data set has one categorical response variables, 7 predictor variables and just under 19000 observations. That means my proximity matrix is approximately 133000 by 133000 which is quite large. To train a random forest on this large a dataset I have to use my institutions high

Good Day, I'm using the randomForest package to perform a classification. If I supply weights to the optional classwt argument are proximity values computed as a weighted average? I understand that the forest will possibly change as a function of the particular weights I supply. Thanks in advance. Mike Michael Fugate Los Alamos National Laboratory Mail Stop MS-F600, Los Alamos, NM

Hello there, How to get the proximity matrix of new data in party package? Thanks. Joseph [[alternative HTML version deleted]]

Hi all, Can some one tell me the difference between the following two formulas? 1. epiG.rf <-randomForest(gamma~.,data=data, na.action = na.fail,ntree = 300,xtest = NULL, ytest = NULL,replace = T, proximity =F) 2.epiG.rf <-randomForest(gamma~.,data=data, na.action = na.fail,ntree = 300,xtest = NULL, ytest = NULL,replace = T, proximity =F) [[alternative HTML version deleted]]

First RC for evdev 2.6. We've only had a few changes since 2.5 but there is a significant rewrite coming up to use the masked valuator bits so I'd like to get out what we have now. Note that in all likelyhood, support for older servers (including server 1.9) will be dropped in the next version. Hence the 2.6 branch will be maintained for a while. This release has some improved tablet

<posted & mailed> Dear all, I'm trying to solve the problem, of how to find clusters of values in a vector that are closer than a given value. Illustrated this might look as follows: vector <- c(0,0.45,1,2,3,3.25,3.33,3.75,4.1,5,6,6.45,7,7.1,8) When using '0.5' as the proximity requirement, the following groups would result: 0,0.45 3,3.25,3.33,3.75,4.1 6,6.45 7,7.1

Hi, I'd like to know how we can choose the distance between two words that we search in a text. I know there is an "op_near" operator but I don't know how I can specified that the number of words between the two specified words should not exceed 10 or 20 or x words. I'm really sorry for my terrible English, I hope I'm understandable!

Are there any options to forming queries with Omega? For instance can you specify a proximity search like "file near 5 manager"? If so, where might I find this documented? I don't see it in the docs directory. Thanks Jim.

...is of course also possible to use more efficient C implementations---either for the distance measure alone, or the whole matrix computation. Input data is not restricted to matrices: provided the proximity measure can handle it, lists and data frames are also accepted. The formulas for binary proximities can conveniently be specified in the a/b/c/d/n format, where the number of concordant/discordant pairs is precomputed on the C code level. We are currently working on support for sparse data. This is also a "Call for Measures": if you feel that a particular similarity of distance mea...