Displaying 3 results from an estimated 3 matches for "altogheth".
Did you mean:
altoghether
2012 Dec 06
1
clustering of binary data
...g possible association (co-presence) of my variables. To do
this, I was trying with cluster analysis.
My main interest is to check for the significance of the obtained clusters.
First, I tried with the pvclust() function, by using method.hclust="ward"
and method.dist="binary". Altoghether it works (clusters and significance
obtained). However, I'm not convinced by the distance matrix. Association
between variables are indeed different from results obtained in PAST by
using Ward on a Jaccard matrix (that should be ok for binary data).
Moreover, when I try to obtain a Jaccard ma...
2010 Jun 04
1
Creating a maxtrix from "conditional prints"
...-3
etc). Now, I want R to consider only those matrices whose "new" column has
value = 1 & whose total number of rows is equal to 2. I can get R to "print"
this result inside the "for" cycle, yet I can't manage to build a single
matrix, to store all the results altoghether - which is what I really want.
Code example:
for (x in 1:10) {
for (y in 1:10) {
qui <- ifelse((mac[,1] == x) & (mac[,5] == y) | (mac[,1] == y) & (mac[,5]
== x), 1, NA)
quo <- cbind(mac,qui)
qua <- subset(quo, qui ==1)
if(nrow(qua) == 2)
print(qua)
}}
result (wrong, now):...
2011 May 11
8
[PATCH 1/4] Btrfs: map the node block when looking for readahead targets
If we have particularly full nodes, we could call btrfs_node_blockptr up to 32
times, which is 32 pairs of kmap/kunmap, which _sucks_. So go ahead and map the
extent buffer while we look for readahead targets. Thanks,
Signed-off-by: Josef Bacik <josef@redhat.com>
---
fs/btrfs/ctree.c | 23 +++++++++++++++++++++--
1 files changed, 21 insertions(+), 2 deletions(-)
diff --git