Spears, W. M.: A compression algorithm for probability transition matrices. In SIAM Matrix Analysis and Applications, Volume 20, #1. (1998) 60-77 Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Dynamic Detection of Deterministic Disk Access Patterns - Peacock (2001) (Correct)
....Q is called the 1 step probability transition matrix . Although there are a number of strategies for reducing the space requirements of the probability transition matrix, each results in an estimator which is not guaranteed to be equivalent to Q, and the reduction is often computationally complex [SPEA98]. Even with compression techniques, the size of the transition matrix is not guaranteed to be anything less than O(N ) But since it isn t likely that we will see access patterns in which every disk sector is accessed before or after 43 every other disk sector, it makes sense that we should be ....
W. M. Spears, A Compression Algorithm for Probability Transition Matrices, in SIAM Matrix Analysis and Applications, Volume 20, #1, pages 60-77, 1998.
Modeling Viral Epidemiology In Connected Networks - William Spears Lora Self-citation (Spears) (Correct)
No context found.
W. Spears, A compression algorithm for probability transition matrices, SIAM Matrix Analysis and Applications, 20 (1998), pp. 60--77.
Aggregating Models of Evolutionary Algorithms - Spears (1999) (5 citations) Self-citation (Spears) (Correct)
....However, since finite population EAs (with or without recombination) can be modeled as Markov chains e.g. see [8] an alternative approach is to find general techniques for automatically aggregating Markov chains. Section 4 summarizes a novel technique for accomplishing this form of aggregation [12]. The advantage of this technique is that it will work with arbitrary classes of fitness functions. The disadvantage is that the aggregation is not error free, although the error is often negligible. 2 Aggregating Models of EAs with Selection and Mutation A population undergoing selection and ....
....the EA. As would be expected, the number of states grows enormously as the population size (or string length) increases. Thus any techniques that are available for automatically aggregating Markov chains can immediately be used to aggregate the Nix and Vose model. We summarize the method of Spears [12] in this section. Consider an example Q matrix obtained from a Markov chain of three states, where the first state is VA , the second state is WVA and the third state is NC : Q = 2 6 6 4 VA WVA NC VA p 1;1 p 1;2 p 1;3 WVA p 2;1 p 2;2 p 2;3 NC p 3;1 p 3;2 p 3;3 3 7 7 5 = 4 However, Annie ....
[Article contains additional citation context not shown here]
Spears, W. (1998) "A compression algorithm for probability transition matrices". SIAM Matrix Analysis and Applications, v20, #1, 60--77.
Analyzing GAs Using Markov Models with Semantically Ordered.. - Spears, De Jong (1996) (1 citation) Self-citation (Spears) (Correct)
....and is frequently a function of time. However, recall that the column masses provide reasonable estimates of the relative amount of time spent in particular states, and hence are good candidates for the weights to be used for lumping (for a mathematical treatment of this lumping algorithm see Spears, 1996). Mathematically, the lumping algorithm can be described as follows. Assume that two states have been chosen for lumping. Let S denote the set of N states, and let the non empty sets S 1 ; SN Gamma1 partition S such that one S i contains the two chosen states, while each other S i is ....
....2 and 3 should have no affect on this value. The rest of the values in Q 0 (which refer to states 2 and 3) are weighted averages (sometimes trivial) of sums of the values in the 2nd and 3rd rows and columns of Q. In general, the exact lumping of arbitrary states is not always possible (see Spears, 1996). So we are left with a situation in which states with identical rows can be combined without difficulty, but is not likely to result in a significant reduction in the number of states since identical rows are encountered relatively infrequently. However, since we are interested in reduced ....
W. M. Spears. (1996) A compression algorithm for probability transition matrices. NRLAIC Technical Report. In preparation.
Using Markov Chains for Link Prediction in Adaptive Web Sites - Zhu, Hong, Hughes (2002) (Correct)
No context found.
Spears, W. M.: A compression algorithm for probability transition matrices. In SIAM Matrix Analysis and Applications, Volume 20, #1. (1998) 60-77
Using Markov Chains for Structural Link Prediction in.. - Zhu, Hong, Hughes (2001) (Correct)
No context found.
Spears, W.: A compression algorithm for probability transition matrices. In SIAM Matrix Analysis and Applications, Vol. 20, No. 1, 60-77 (1998).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC