Displaying 20 results from an estimated 285 matches for "proxim".
2012 Feb 01
1
randomForest: proximity for new objects using an existing rf
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>
2010 May 20
1
finding euclidean proximate points in two datasets
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 dataset of 40k+
points in one set, and a 700 in the other.
A very inefficient example of what I'm looking for:...
2010 Oct 21
1
RandomForest Proximity Matrix
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 incr...
2019 Dec 18
0
[RFC 00/13] virtio-iommu on non-devicetree platforms
...> The PCI root-complex node of IORT has an ATS attribute, which we can
> > already use. However its scope is the root complex, not individual
> > root ports like with DMAR.
> >
> > I'm not very familiar with NUMA, but it looks like we just need to
> > specify a proximity domain in relation to the SRAT table, for each
> > viommu? The SMMUv3 node in IORT has a 4-bytes "proximity domain"
> > field for this. We can add the same to the VIOT virtio-iommu nodes
> > later, since the structures are extensible.
> >
> I think there the...
2011 Sep 04
5
Ranking and term proximity
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?
For example, if I search f...
2005 Jun 14
7
OT: US city proximity search
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
2007 Feb 15
3
Proximity searching in rdig ferret
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/.
2007 Sep 28
1
Proximity Detection: Motorola Q + Bluetooth + Asterisk
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
2008 Dec 26
2
about randomForest
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 na.fail.default(list(class = c(17L, 17L, 17L, 29L, 29L, 29L, :
missing v...
2004 Oct 13
1
random forest -optimising mtry
...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...
2006 Jan 27
1
Classifying Intertwined Spirals
...th a radial basis: exp(-gamma*|u-v|^2).
You should be able to see a PNG of the resulting plot here:
http://www.flickr.com/photos/60118409 at N00/91835679/
The problem is that that's not good enough. I want a better fit. I
think I can get one, I just don't know how.
There's a paper on Proximal SVMs that claims a better result. To the
best of my knowledge, PSVMs should not outperform SVMs, they are
merely faster to compute. You can find the paper (with the picture of
their SVM) on citeseer:
http://citeseer.ifi.unizh.ch/cachedpage/515368/5
@misc{ fung-proximal,
author = "G. Fung a...
2012 Mar 23
1
Memory limits for MDSplot in randomForest package
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 performance computer.
Using this setup I was able to train a randomForest with the proximity
argument set to TRUE. At this point I wanted to construc...
2007 Feb 05
0
random forest proximities
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
87545
(505) 667-0398
2007 Dec 31
0
proximity on prediction in cforest
Hello there,
How to get the proximity matrix of new data in party package? Thanks.
Joseph
[[alternative HTML version deleted]]
2012 Oct 22
1
random forest
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]]
2010 Nov 22
0
[ANNOUNCE] xf86-input-evdev 2.5.99.901
...t 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 handling, notably for tablets that
send coordinates while still being out-of-proximity. Proximity support
itself has been added to evdev as well, devices that support it will get
DevicePresence events (note that proximity is not exposed as an axis for
XI2, there are some design questions that need to be clarified first).
The button mapping code was changed to support styli. Note...
2007 Dec 21
3
Finding overlaps in vector
<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
Jim Holtman proposed a very elegant solution in
http://tolstoy.newcastle.edu.au/R/e2/help/07/07/21286.html, which I have
modified and perused since he wrote it to me. The beauty of this approach
is that it...
2011 Dec 07
2
How to choose the proximity between search words
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!
2006 Feb 07
1
Omega
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.
2007 Jul 09
0
New package "proxy" for distances and similiarities
...tance and similarity matrices made it to
CRAN, and will propagate to the mirrors soon.
It includes an enhanced version of "dist()" with support for more than
40 popular similarity and distance measures, both for auto- and
cross-distances. Some important ones are implemented in C.
The proximity measures are stored in a registry which can easily be
queried and extended by users at run-time. For adding a new measure, the
simplest way is to provide the distance measure as a small R function,
the package code will do the loops on the C code level to create the
proximity matrix. It is o...