similar to: Graph Edit Distance

Hi there, I'm working on a very specific topic related to graph theory. In particular I'd like to compare two graphs by a general dissimilarity function in graph domain, named graph edit distance (GED). Do you know if there exists a package or a script in R implementing algorithm to  compute GED? Thanks Domenico [[alternative HTML version deleted]]

Hi Petr, The following is different line of thought which is posted in different form, maybe you have some wise input on it. "I need to find Efficient(tracktable) deterministic algorithm for Matching Weighted Graphs with bounded degree. Now we all know Graph matching is non-tractable but when degree of vertex has upper bound are there any tractable algorithm? Does this special case comes

Hello all, I'm having a spot of trouble. I have made a very nice distance matrix from some comparison calculations. However, the matrix is 3096 x 3096, so it's relatively large. Currently I'm using the svn package as it seems to work for my data. The graph package errors and says the "adjacency matrix must be symmetric for undirected graphs". I though 3096 x 3096 was

I need to use the Bhattacharyya distance metric to determine population separation. Has anyone written a Bhattacharyya distance metric function in R? -- View this message in context: http://old.nabble.com/Bhattacharyya-distance-metric-tp26221259p26221259.html Sent from the R help mailing list archive at Nabble.com.

Hello, pardon my ingorance, but what distance metric is used in this function in the nnclust package? The manual only says: "Find the nearest neighbours of points in one data set from another data set. Useful for Mallows-type distance metrics." BR, Jay

Dear All, I am in the somewhat unfortunate position of having to reproduce the results previously obtained from (non-metric?) MDS on a "kinship" matrix using Statistica. A kinship matrix measures affinity between groups, and has its maximum values on the diagonal. Apparently, starting with a nxn kinship matrix, all it was needed to do was to feed it to Statistica flagging that the

Hello All, I went through lot of searching for papers to do clustering on Co-Authroship.I ran SNA metrics on my Undirected Graph(betweenness,Closeness,Eigen Vector) using R. After running the sna Metrics I found important nodes and did clustering on those nodes based on Binding strength .This clustering is done through if they are connected.I would like to do clustering based on Weight of the

Hello R experts, I went through R mailing,Nabble R.I could not find solution.Can someone help me. I have undirected Graph. Here is an example of spreadsheet I have( Unique 3559 Nodes) snippet of 4 rows. Node1 Node2 Weights 1 2 5 2 3 30 2 4 30 1 4 5 3 4 30 1 3 2 I created a program reading the csv and created a Adjacency matrix.From the adjacency matrix I created graph.I am not sure the

I'm looking for a way to do (product moment) graph correlation between multiple unlabeled graphs G to Gn. Basically I have 900 individual samples of a 48x48 adjacency matrix which I've listed as a 3rd dimension of a single array. So it looks something like [48,48,i] where i is each individual subject's adjacency matrix. If i run the gcor function on any two graphs for example

***********reading in data********** data<-read.table("microarray.txt",header=T, sep="\t") head(data) dim(data) attach(data) ***********creating matrix and calculating variance across probesets******** x<-1:20000 y<-2:141 data.matrix<-data.matrix(data[,y]) variableprobe<-apply(data.matrix[x,],1,var) hist(variableprobe) **************filter out low

The documentation for agrep says it uses the Levenshtein edit distance, but it seems to get this wrong in certain cases when there is a combination of deletions and substitutions. For example: > agrep("abcd", "abcxyz", max.distance=1) [1] 1 That should've been a no-match. The edit distance between those strings is 3 (1 substitution, 2 deletions), but agrep matches

Olly Betts, Has anyone tested the new Edit Distance(SQLServer) algorithm compared to the current one? If you need any inditional information or code, please let us know. Thank you.

Dear all, I have a txt file of the following format that describes the relationships between a network of a certain number of nodes. {4, 2, 3} {3, 4, 1} {4, 2, 1} {2, 1, 3} {2, 3} {} {2, 5, 1} {3, 5, 4} {3, 4} {2, 5, 3} For example the first line {4, 2, 3} implies that there is a connection between Node 1 and Node 4, a connection between Node 1 and Node 2 and a connection between Node 1 and

Hi, Does anyone know of a package in R that has a function to convert network data (e.g. an adjacency matrix or ) from 2-mode to 1-mode? I am conducting social network analysis. I know that Pajek has this function under Net --> Transform --> 2-mode to 1-mode --> Rows. I have searched the documentation under packages 'sna', 'network', 'igraph', and

I have a column of words, for example "DOG" "DOOG" "GOD" "GOOD" "DOOR" ... and I am interested in creating a matrix that contains the string edit distances between each pair of words. I am this close -> ' ' <- to writing the algorithm myself (which will allow for different variations on the string edit rules, indels,

Hello all, I'm having trouble creating an adjacency matrix. Basically, I need to turn the following distance matrix into an adjacency matrix based on whether values are >1.5 or not. If they are >1.5, then the returned value should be 0. If they are =<1.5, then the returned value should be 1. DistanceMatrix: A B C D E [1,]

I posted this yesterday to r-help and Ben Bolker suggested reposting it here... Dickison, Daniel <ddickison <at> carnegielearning.com> writes: > > The documentation for agrep says it uses the Levenshtein edit distance, > but it seems to get this wrong in certain cases when there is a > combination of deletions and substitutions. For example: > > >

Hi, I have a data set consisting of the x and y coordinate locations of 1600 points. I would like to generate a graph using the functions in igraph. However the graph making functions in igraph requires the data to be in the form of an adjacency matrix. I'd like some advice on how to convert my point pattern to an adjacency matrix or functions out there that would do it directly. I've

Hi, There are two packages providing knn classification: class and knnTree. However, it seems both uses Eucleadian distances only. How can I uses a custom distance function with either package? Thanks, Xiao-Jun

Hello, I am working with graph and adjacency matrix, the package 'graph' seems to be appropriate for this. An example in the package > mat <- rbind(c(0, 0, 1, 1), + c(0, 0, 1, 1), + c(1, 1, 0, 1), + c(1, 1, 1, 0)) > rownames(mat) <- colnames(mat) <- letters[1:4] > graph1 <- new("graphAM", adjMat=mat) > graph1 A