Extending adjacency matrix neighbours - matlab
I have an adjacency matrix. For example, the following,
+---+-------------------------------+
| | 1 2 3 4 5 |
+---+-------------------------------+
| 1 | 0 1 0 0 0 |
| 2 | 1 0 0 0 1 |
| 3 | 0 0 0 1 0 |
| 4 | 0 0 1 0 1 |
| 5 | 0 1 0 1 0 |
+---+-------------------------------+
how can we extract the following adjacency matrix, without for loops, where for each element (row or column) the neighbors of the already existed neighbors were added? For example, the element 3 has neighbor the element 4 so in the new adjacency matrix the element 3 will have neighbors the elements 4 and 5.
+---+-------------------------------+
| | 1 2 3 4 5 |
+---+-------------------------------+
| 1 | 0 1 0 0 1 |
| 2 | 1 0 0 1 1 |
| 3 | 0 0 0 1 1 |
| 4 | 0 1 1 0 1 |
| 5 | 1 1 1 1 0 |
+---+-------------------------------+
Best regards,
Thoth.
If A is your adjacency matrix, then the matrix you want is A2, where:
A2 = (A+A^2) > 0
This is because the square of an adjacency matrix has components s_ij, where s_ij is the number of paths of length two between i and j. (In fact (A^n)_ij is the number of paths from i to j of length n).
Therefore, if you add A (which contains all pairs joined by a path of length 1) to A^2 which contains all pairs linked by a path of length two, you'll get the number of paths of length 1 or 2. (And we only care if this is positive for this case). Paths of length two are paths to the neighbours of neighbours.
You might want to set the diagonal back to zero though
Related
two-variable output truth table for two-variable input
I have 2-bit variable that is needed to be converted in another one. I made such a table i1 i2 | o1 o2 0 0 | x x 0 1 | 0 1 1 0 | 1 0 1 1 | 0 1 But I cannot figure out how to do it except something like (o1(i1,i2)&0b01 << 1) | (o2(i1,i2) & 0b01)
K-map ( karnaugh map ) 8,4,-2,-1 to binary code conversion
I'm taking computer science courses and some digital design knowledge is required, so I'm taking digital design 101. Image above is representing the conversion process of 8,4,-2,-1 to binary using K-map (Karnaugh map). I have no idea why 0001, 0011, 0010, 1100, 1101, 1110 are marked as 'X'. For 0001, 0011, 0010, they could be expressed as 8,4,-2,-1 as 0111, 0110, 0101. And for 1100, 1101, 1110, 1110 can still be expressed as 1100 in 8,4,-2,-1 form as 1100. rests cannot be expressed in 8,4,-2,-1 since 1100 is the biggest amount of number in 8,4,-2,-1 binary form (I think). Is there something I'm missing? I understand the excess-3 to binary code conversion provided from my textbook example ( m10-m15 are marked as 'X' since excess-3 were used to express only 0-9.)
According to the definition of BCD, 1 decimal digit (NOT one number) is represented by 4 bits. The 4 given inputs can therefore represent only values from interval from 0 to 9. The corresponding and complete truth-table looks like this: decimal | 8 4 -2 -1 | decimal || BCD /index | A B C D | result || W X Y Z ----------------------------------||--------- 0 | 0 0 0 0 | 0 || 0 0 0 0 ~ 0 1 | 0 0 0 1 | -1 || X X X X 2 | 0 0 1 0 | -2 || X X X X 3 | 0 0 1 1 | -2-1=-3 || X X X X 4 | 0 1 0 0 | 4 || 0 1 0 0 ~ 4 5 | 0 1 0 1 | 4-1=3 || 0 0 1 1 ~ 3 6 | 0 1 1 0 | 4-2=2 || 0 0 1 0 ~ 2 7 | 0 1 1 1 | 4-2-1=1 || 0 0 0 1 ~ 1 8 | 1 0 0 0 | 8 || 1 0 0 0 ~ 8 9 | 1 0 0 1 | 8-1=7 || 0 1 1 1 ~ 7 10 | 1 0 1 0 | 8-2=6 || 0 1 1 0 ~ 6 11 | 1 0 1 1 | 8-2-1=5 || 0 1 0 1 ~ 5 12 | 1 1 0 0 | 8+4=12 || X X X X 13 | 1 1 0 1 | 8+4-1=11 || X X X X 14 | 1 1 1 0 | 8+4-2=10 || X X X X 15 | 1 1 1 1 | 8+4-2-1=9 || 1 0 0 1 ~ 9 The K-maps then match the truth-table by its indexes: Using the K-maps, it can be indeed simplified to these boolean expressions: W = A·B + A·¬C·¬D X = ¬B·C + ¬B·D + B·¬C·¬D Y = ¬C·D + C·¬D Z = D
How to search through arrays to find a match
I have a 4x~50,000 array, where the first 3 rows hold the x y z coordinates, then some corresponding values of a given location. i.e., row 1 | 1 2 3 4 5 1... row 2 | 1 1 1 1 1 1... row 3 | 0 0 0 0 0 1... row 4 | 0.7 0.2 1.0 0.3 0.3 0.5 I want to rearrange this data into a 3D array, to plot this data in fMRI style for example, 3Darray(1,1,0) = 0.7 3Darray(2,1,0) = 0.2 3Darray(3,1,0) = 1.0 . . . I'm having trouble going through the rows simultaneously to match all three x,y,z, values. Any suggestions are welcome! Thank you, Regards, P
This is a job for sub2ind! Here's a dummy array I made for testing, %// example array array=[1 2 3 4 5 1 2 3 4 5 1 1 1 1 1 2 2 2 2 2 1 1 1 1 1 1 1 3 3 3 rand(1,10)] And the code: n=max(array(1:3,:),[],2).'; %// get size of final array m=zeros(n); %// make an array of zeros of that size ind=sub2ind(n,array(1,:),array(2,:),array(3,:)); %// get linear indices of elements m(ind)=array(4,:); %// put elements into the array
Generating a matrix containing 3 numbers
I am trying to create an 8x8 matrix containing 0s, 1s and 2s. Each row and each column should contain two 0s, three 1s and three 2s. Previously I have used the below to generate an example containing only 1s and 0s. output = zeros(8, 8); for i=1:8 tmp = (1:8) + (i); tmp = rem(tmp, 4); output(i,:) = tmp; output(i,:) = tmp > 0; end output = 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 0 1 1 1 0 1 1 1 1 1 1 0 1 1 1 0 However I would now like something similar to the following: output = 1 1 0 1 2 2 0 2 1 0 1 2 2 0 2 1 0 1 2 2 0 2 1 1 1 2 2 0 2 1 1 0 2 2 0 2 1 1 0 1 2 0 2 1 1 0 1 2 0 2 1 1 0 1 2 2 2 1 1 0 1 2 2 0 Thanks for your help.
What you have in your example is a Hankel matrix so you could use the hankel function c = [1 1 0 1 2 2 0 2]; k = [2 1 1 0 1 2 2 0]; A = hankel(c,k) where c is the first column of the output matrix and k is the last row. Making your output matrix a Hankel matrix is a good idea (based on your requirements) as it will enforce the row and column frequency counts for each value. You would not necessarily get this just by creating rows that are random permutations of a base row (using randperm for example) as duplicate rows would be possible which would break your column requirements. As an example, if you want random c with fixed numbers of specific elements, you can randomly permute a base vector containing the required values and frequencies - as per your requirement this would be c = [0 0 1 1 1 2 2 2]; index = randperm(numel(c)); c = c(index); c = 0 2 0 2 2 1 1 1 To get the square Hankel structure then choose k to be the next cyclic permutation of c k = circshift(c',1)' k = 1 0 2 0 2 2 1 1 and just call hankel with these as mentioned above A = hankel(c,k) A = 0 2 0 2 2 1 1 1 2 0 2 2 1 1 1 0 0 2 2 1 1 1 0 2 2 2 1 1 1 0 2 0 2 1 1 1 0 2 0 2 1 1 1 0 2 0 2 2 1 1 0 2 0 2 2 1 1 0 2 0 2 2 1 1 The above output is based on what I got on my machine based on the output from randperm. Any output matrix generated using the above will meet your requirements specified in the question.
Difference between correctly / incorrectly classified instances in decision tree and confusion matrix in Weka
I have been using Weka’s J48 decision tree to classify frequencies of keywords in RSS feeds into target categories. And I think I may have a problem reconciling the generated decision tree with the number of correctly classified instances reported and in the confusion matrix. For example, one of my .arff files contains the following data extracts: #attribute Keyword_1_nasa_Frequency numeric #attribute Keyword_2_fish_Frequency numeric #attribute Keyword_3_kill_Frequency numeric #attribute Keyword_4_show_Frequency numeric ... #attribute Keyword_64_fear_Frequency numeric #attribute RSSFeedCategoryDescription {BFE,FCL,F,M, NCA, SNT,S} #data 0,0,0,34,0,0,0,0,0,40,0,0,0,0,0,0,0,0,0,0,24,0,0,0,0,13,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,BFE 0,0,0,10,0,0,0,0,0,11,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,BFE 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,BFE ... 20,0,64,19,0,162,0,0,36,72,179,24,24,47,24,40,0,48,0,0,0,97,24,0,48,205,143,62,78, 0,0,216,0,36,24,24,0,0,24,0,0,0,0,140,24,0,0,0,0,72,176,0,0,144,48,0,38,0,284, 221,72,0,72,0,SNT ... 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,S And so on: there’s a total of 64 keywords (columns) and 570 rows where each one contains the frequency of a keyword in a feed for a day. In this case, there are 57 feeds for 10 days giving a total of 570 records to be classified. Each keyword is prefixed with a surrogate number and postfixed with ‘Frequency’. My use of the decision tree is with default parameters using 10x validation. Weka reports the following: Correctly Classified Instances 210 36.8421 % Incorrectly Classified Instances 360 63.1579 % With the following confusion matrix: === Confusion Matrix === a b c d e f g <-- classified as 11 0 0 0 39 0 0 | a = BFE 0 0 0 0 60 0 0 | b = FCL 1 0 5 0 72 0 2 | c = F 0 0 1 0 69 0 0 | d = M 3 0 0 0 153 0 4 | e = NCA 0 0 0 0 90 10 0 | f = SNT 0 0 0 0 19 0 31 | g = S The tree is as follows: Keyword_22_health_Frequency <= 0 | Keyword_7_open_Frequency <= 0 | | Keyword_52_libya_Frequency <= 0 | | | Keyword_21_job_Frequency <= 0 | | | | Keyword_48_pic_Frequency <= 0 | | | | | Keyword_63_world_Frequency <= 0 | | | | | | Keyword_26_day_Frequency <= 0: NCA (461.0/343.0) | | | | | | Keyword_26_day_Frequency > 0: BFE (8.0/3.0) | | | | | Keyword_63_world_Frequency > 0 | | | | | | Keyword_31_gaddafi_Frequency <= 0: S (4.0/1.0) | | | | | | Keyword_31_gaddafi_Frequency > 0: NCA (3.0) | | | | Keyword_48_pic_Frequency > 0: F (7.0) | | | Keyword_21_job_Frequency > 0: BFE (10.0/1.0) | | Keyword_52_libya_Frequency > 0: NCA (31.0) | Keyword_7_open_Frequency > 0 | | Keyword_31_gaddafi_Frequency <= 0: S (32.0/1.0) | | Keyword_31_gaddafi_Frequency > 0: NCA (4.0) Keyword_22_health_Frequency > 0: SNT (10.0) My question concerns reconciling the matrix to the tree or vice versa. As far as I understand the results, a rating like (461.0/343.0) indicates that 461 instances have been classified as NCA. But how can that be when the matrix reveals only 153? I am not sure how to interpret this so any help is welcome. Thanks in advance.
The number in parentheses at each leaf should be read as (number of total instances of this classification at this leaf / number of incorrect classifications at this leaf). In your example for the first NCA leaf, it says there are 461 test instances that were classified as NCA, and of those 461, there were 343 incorrect classifications. So there are 461-343 = 118 correctly classified instances at that leaf. Looking through your decision tree, note that NCA is also at other leaves. I count 118 + 3 + 31 + 4 = 156 correctly classified instances out of 461 + 3 + 31 + 4 = 499 total classifications of NCA. Your confusion matrix shows 153 correct classifications of NCA out of 39 + 60 + 72 + 69 + 153 + 90 + 19 = 502 total classifications of NCA. So there is a slight difference between the tree (156/499) and your confusion matrix (153/502). Note that if you are running Weka from the command-line, it outputs a tree and a confusion matrix for testing on all the training data and also for testing with cross-validation. Be careful that you are looking at the right matrix for the right tree. Weka outputs both training and test results, resulting in two pairs of matrix and tree. You may have mixed them up.