Displaying 20 results from an estimated 600 matches similar to: "Speeding up simulation of mean nearest neighbor distances"
2012 Jun 20
1
nearest neighbours and their ID
Dear R users,
I used nndist() to gain the distance of 2 nearest
neighbours of the points in my dataset. Is there a way of getting the ID numbers
of these nearest neighbours (along with their distances).
The command I used: nn2 <- nndist(X2, k=1:2). This is the output of the nearest neighbour distances I got (the IDs of the given points are there but their IDs aren't). Any help or
2011 Apr 11
4
nndist R vs. ArcGIS
Can anyone tell me why I would get different average nearest neighbor values
for the same set of coordinates between ArcGIS 10 and R? Sometimes the
difference in distance is over 1.3 km.
Alexis
--
View this message in context: http://r.789695.n4.nabble.com/nndist-R-vs-ArcGIS-tp3442375p3442375.html
Sent from the R help mailing list archive at Nabble.com.
2004 Aug 19
3
Do you know if you can map a large minimum spanning tree in R?
Thanks Mike.
My data has longitude and latitude coords and I used distAB {clim.pact}
then mst {ape} to calculate my minimum spanning tree. The nodes are
telecoms sites from all over Australia. My goal is to determine the
minimum cost of linking them via cabling, and I'm starting by
calculating the distance "as the crow flies", but will probably
eventually need to calculate the
2005 Oct 10
3
Vectorizing loop
Hi
I have the following loop and would like to vectorize it. Any ideas if
it is possible?
Thanks,
Rainer
Tha Loop:
for (i in 2:Result$NoSims)
{
ppp <- runifpoint(Result$NoPlants)
K <- Kest(ppp)
Result$LSim[i,] <- sqrt(K$iso / pi) - K$r
CM <- (Result$LSim[i,] * Result$LSim[i,]) / abs(K$r[2] - K$r[1])
Result$SigCM[i] <- sum(CM, na.rm=TRUE)
print(i)
flush.console()
}
2005 Oct 10
5
Show Progress in loop
Hi
I have a loop which is doing time consuming calculations and I would
like to be able to have some feedback on where it is in it's
calculations. I tried to simply show the counter variable in the loop,
but id doesn't work as all display seems to be delayed until the loop is
completed. Is there any way of displaying the progress of a loop?
Rainer
The loop:
for (i in
2003 Jun 09
1
estimate the number of clusters
Dear All,
I am using Silhouette to estimate the number of clusters in a microarray
dataset.
Initially, I used the iris data to test my piece of code as follows:
library(cluster)
data(iris)
mydata<-iris[,1:4]
maxk<-15 # at most 15 clusters
myindex<-rep(0,maxk) # hold the si values for each k clusters
mdist<-1-cor(t(mydata)) #dissimlarity
2007 Mar 26
2
sampling from the uniform distribution over a convex hull
Ranjan Maitra writes:
> Does anyone have a suggestion (or better still) code for sampling
> from the uniform distribution over the convex hull of a set of
> points?
This is implemented in library 'spatstat'.
If x and y are vectors of coordinates of your initial set of points,
library(spatstat)
W <- convexhull.xy(x, y)
P <- runifpoint(42, W)
will compute
2008 May 09
1
save to file
Hi,
I am new to R. I am using spatstat package to generate some sample points but don't know how to save the result to file. Could anyone please give me some instructions? Thanks
I generate some random point data by using:
pp<-runifpoint(100)
I can plot it out with plot(pp)
I suppose that pp contains x and y. How can I save these x, y pairs to file that has following format?
x1,y1
x2,y2
2004 May 29
1
Rhelp: Need help interpreting plots in spatstat
Hello everybody--
I have been playing with my data in spatstat, and what I'd like to
present is a basic exploratory spatial analysis. I have used the
following code, using a ppp.object called tsdspoints. The code
develops the simulations and the envelopes I want, but I don't
understand my first plot here, the [tsds.ghat.short$r,
tsds.ghat.short$raw]...I cobbled together this code
2009 Aug 12
3
Random sampling while keeping distribution of nearest neighbor distances constant.
Dear All,
I cannot find a solution to the following problem although I imagine
that it is a classic, hence my email.
I have a vector V of X values comprised between 1 and N.
I would like to get random samples of X values also comprised between
1 and N, but the important point is:
* I would like to keep the same distribution of distances between the X values *
For example let's say N=10 and
2002 Sep 06
1
Installing splancs_2.01-9 on Red Hat Linux 7.3
Hi all,
I'm trying to install the splancs contributed package on a Redhat 7.3
system with R 1.5.1 installed. I've installed the readline41-4.1-10 RPM
which Redhat requires for R and it works great, thanks very much.
However, when I attempt to R CMD INSTALL splancs_2.01-9.tar.gz as root,
I get the following error message during the install:
[snip]
g77 -fPIC -O2 -m486
2013 Apr 15
2
nearest stations in distance matrix
Dear R-user,
Is there a way in R to locate the nearest 5 indices to a station, based on distances in a distance matrix. In other words i want to have nearest stations based on the distances in the matrix. The distance matrix, i have, has dimension 44*44.
Thankyou very much in advance
Elisa
[[alternative HTML version deleted]]
2019 Nov 22
2
Tablegen PAT limitation?
def STOREbos { // InstructionEncoding Instruction RPPInst RPPInstMMEMrr
field bits<32> Inst = { 0, 0, 0, 1, rs1{2}, rs1{1}, rs1{0}, index{0}, 0, 0, 0, 1, 0, rbase{3}, rbase{2}, rbase{1}, rbase{0}, rbase{4}, roffset{4}, roffset{3}, roffset{2}, roffset{1}, roffset{0}, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
field bits<32> SoftFail = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
2010 Feb 21
1
How to: Compare Two dendrograms (Hierarchical Clusterings) ?
Hello all,
I wish to compare two dendrograms (representing Hierarchical Clusterings).
My problems are several:
1) how do I manually create a dendrogram object ?
That is, how can I reconstruct it as an "hclust" object that creates such a
dendrogram, when all I have is the dendrogram image (but don't have the
underlaying distance matrix that produced it) ?
I see that there is a
2019 Nov 21
2
Tablegen PAT limitation?
Hi Krzysztof,
Today I try it on llvm9.0.0 version.
def bos : RPPInstMMEMrr<OPC_STORE,
(outs), (ins MGPR:$rs1, SGPR32:$rbase, MGPR:$roffset, uimm2:$rshift),
!strconcat(opcodestr, ""), "$rs1,
2019 Nov 25
2
Tablegen PAT limitation?
You are welcome.
I changed the pattern, the same old error pop up again, crash in the same place.
Type set is empty for each HW mode:
possible type contradiction in the pattern below (use -print-records with llvm-tblgen to see all expanded records).
vtInt: (vt:{ *:[Other] })
UNREACHABLE executed at /home/nancy/work/rpp_clang/llvm/utils/TableGen/CodeGenDAGPatterns.cpp:824!
2012 Jul 02
1
SPATSTAT: Minimum points for a Ripley K to be sensible?
Hello,
What are the minimum number of points in a point pattern before a
clustering analysis using a Ripley K function loses any meaning?
I haven't been able to find much comment in the literature about this
--- instead case examples typically use 100-200 points as a minimum.
Regards,
Sebastian Pucilowski
2015 Oct 21
3
Yet an other gent group issue
Hi
I'm setting up samba 3 (Debian Wheezy) as a member of a samba 4 domain.
wbinfo -u and wbinfo -g are working
getent passwd -s winbind is working
getent group -s winbind is NOT working
However, getent group domain\ users is working and I cam switch to a domain
user with the command su
Here is the output of getent with domain users
root at member-01:~# getent group domain\ users
domain
2011 Feb 18
0
Shared nearest neighbor (SNN) clustering algorithm implementation?
Hello,
is there an implementation available for a shared nearest neighbor
(SNN) clustering algorithm?
//Jay
2002 Apr 10
0
Discriminant Adaptive Nearest Neighbor
Dear R users,
Is there anyone who is aware of a R or S package that has Discriminant
Adaptive Nearest Neighbor (DANN) classification by Hastie and Tibshirani?
I have used the search services in R website but no luck.
Thanks in advance!
Jonathan
-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-
r-help mailing list -- Read