similar to: Need help in multi-dimensional clustering

All, How can we find a distance matrix for categorical data ie. given a csv below var1 var2 var3 var4 element1-1 yes x a k element1-2 no y b l element1-3 maybe y c m how can i compute the distance matrix between all the elements Actually i need it to create clusters on top

Hello list. My apologies if this topic has been discussed before on the list but I was unable to find it. I'm working on a way to cluster PCAP files according to the events recorded within them. I've decided to use Bro-IDS for feature extraction. I am looking at dbscan within the FPC library to accomplish my goal. Is it possible to feed a data frame to dbscan with more than two columns

Hi people, Does anybody know some Density-Based Method for clustering implemented in R? Thanks, Fernando Prass _______________________________________________________

Hello everyone, When looking for information about clustering of spatial data in R I was directed towards DBSCAN. I've read some docs about it and theb new questions have arisen. DBSCAN requires some parameters, one of them is "distance". As my data are three dimensional, longitude, latitude and temperature, which "distance" should I use? which dimension is related to

Hello Bug people, I have an unexpected behavior and am unsure whether the problem is in my thinking, my implementation or the program R. Basically I get two different answers depending on how I call a function which takes other functions as arguments as indicated below. To me it should make no difference if f is a function that returns the function g then z(f(x)) whould give the same as y<-

Hello all. I wish to run k-means with "manhattan" distance. Since this is not supported by the function "kmeans", I turned to the "pam" function in the "fpc" package. Yet, when I tried to have the algorithm run with different starting points, I found that pam ignores and keep on starting the algorithm from the same starting-points (medoids). For my

Hi, I'm trying to implement the DBSCAN algorithm to get O(N*LogN) complexity and I'd need a spatial tree of some sort (kd,r,bd..), or a function that computes radius-based search on spatial data, i.e. given a radius eps finds ALL the points which fall in the corresponding hypersphere centered on the current examined point. Is there a package with this features? So far I found RANN

Yeah, there's a lot of things this could be. On the memdep side: Note that memdep is not actually properly updated in all cases by most passes that claim to not invalidate it (they don't invalidate dependent pointers, only pointers they directly touch). There's already a bug filed about this. So far we've only seen missed-opt, not wrong code from this. But it should be possible

hi there, whenever i try the clusterwise regression from the fpc package, there occurs the following problem: the first cluster is always designed in a way, that when i run a normal linear regression on the independent variables to describe the dependent variable (only on those respondents from the first cluster) - then the regression uses only one independent variable that describes the whole

Hi, I've stumbled upon a case where I think gvn does a bad (wrong) optimization. It's a bit messy to debug though so I'm not sure if I should just write a PR about it a let someone who knows the code look at it instead. Anyway, for the bug to trigger I need to run the following passes in the same opt invocation: -sroa -instcombine -simplifycfg -instcombine -gvn The problem

rendercheck -f a8r8g8b8 passes as much as on a GK208, and xv appears to work. Very lightly tested. Instead of sticking coordinates into pushbufs, the vertex shader is modified to read them from a constbuf, indexed by vertex id. This approach could be used for all nvc0 generations, but I didn't want to rock the boat. Signed-off-by: Ilia Mirkin <imirkin at alum.mit.edu> ---

Looks reasonable, some minor comments below. On 10/16/2016 02:06 AM, Ilia Mirkin wrote: > rendercheck -f a8r8g8b8 passes as much as on a GK208, and xv appears to > work. Very lightly tested. > > Instead of sticking coordinates into pushbufs, the vertex shader is > modified to read them from a constbuf, indexed by vertex id. This > approach could be used for all nvc0 generations,

Author: schwartz Repository: /hg/zfs-crypto/gate Revision: f5f3bfec5aa8a6e68f91ded399aa52be0424cd76 Log message: 6390254 fpc shouldn''t clutter sun4v unix with specialized hypervisor definitions 6390258 fpc should use hypervisor versioning APIs when available 6393704 pcitool dumps core with invalid options 6396857 fpc module causes boot-time panic on non-fire pcie hostbridge 6402441 sun4v

Dear R users, I?m please to announce the available on CRAN of new package largeVis.(*) largeVis offers three major features: - A fast implementation of the LargeVis algorithm. LargeVis is for visualizing high-dimensional datasets, similar to (and of similar quality to) t-SNE. But, LargeVis runs in O(n) time, which makes it feasible to use on datasets with millions of rows and thousands of

Dear R users, I?m please to announce the available on CRAN of new package largeVis.(*) largeVis offers three major features: - A fast implementation of the LargeVis algorithm. LargeVis is for visualizing high-dimensional datasets, similar to (and of similar quality to) t-SNE. But, LargeVis runs in O(n) time, which makes it feasible to use on datasets with millions of rows and thousands of

v5: Rebased on depbar removal patch; removed a redundant read dep-bar. This patch adds proper delays to maxwell exa shaders. rendercheck tests seem consistent with/without this patch. I haven't extensively tested them though. Trello: https://trello.com/c/6LPB2EIS/174-update-maxwell-shaders-with-proper-delays Signed-off-by: Aaryaman Vasishta <jem456.vasishta at gmail.com> ---

This patch adds proper delays to maxwell exa shaders. rendercheck tests seem consistent with/without this patch. I haven't extensively tested them though. Trello: https://trello.com/c/6LPB2EIS/174-update-maxwell-shaders-with-proper-delays Signed-off-by: Aaryaman Vasishta <jem456.vasishta at gmail.com> --- src/shader/exac8nv110.fp | 10 +++++----- src/shader/exac8nv110.fpc | 18

I saw that R language has a cluster package which has in built PAM, CLARA and Kmeans (and many more) Clustering Algorithms. But, I couldnot find DBSCAN, ROCK, BIRCH algorithms (which I feel are standard ones). Aren't these implemented as well? Bhanu Kalyan K B.Tech Final Year, CSE Tel: +91-9885238228 Alternate E-Mail: reach4kalyan@gmail.com --------------------------------- We

rendercheck -f a8r8g8b8 passes as much as on a GK208, and xv appears to work. Very lightly tested. Instead of sticking coordinates into pushbufs, the vertex shader is modified to read them from a constbuf, indexed by vertex id. This approach could be used for all nvc0 generations, but I didn't want to rock the boat. Signed-off-by: Ilia Mirkin <imirkin at alum.mit.edu> --- Note: this

Do you still have some glitches or does it work correctly now? Did you also remove the spurious wait dep bars between v3 and v4? On 06/27/2017 05:16 PM, Aaryaman Vasishta wrote: > v4: Updated the wait dependancy bars based on tex component masks. > > This patch adds proper delays to maxwell exa shaders. Tested with > rendercheck -f a8r8g8b8. > > I am still wondering whether