#### Filter Results:

- Full text PDF available (11)

#### Publication Year

1997

2017

- This year (2)
- Last 5 years (12)
- Last 10 years (12)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Kyle Kloster, David F. Gleich
- KDD
- 2014

The heat kernel is a type of graph diffusion that, like the much-used personalized PageRank diffusion, is useful in identifying a community nearby a starting seed node. We present the first deterministic, local algorithm to compute this diffusion and use that algorithm to study the communities that it produces. Our algorithm is formally a relaxation method… (More)

- J L Williams, C A Hathaway, K L Kloster, B H Layne
- The American journal of physiology
- 1997

Frequently in biomedical literature, measurements are considered "not statistically different" if a statistical test fails to achieve a P value that is < or = 0.05. This conclusion may be misleading because the size of each group is too small or the variability is large, and a type II error (false negative) is committed. In this study, we examined the… (More)

- David F. Gleich, Kyle Kloster
- Internet Mathematics
- 2015

We consider stochastic transition matrices from large social and information networks. For these matrices, we describe and evaluate three fast methods to estimate one column of the matrix exponential. The methods are designed to exploit the properties inherent in social networks, such as a power-law degree distribution. Using only this property, we prove… (More)

- Kyle Kloster, David F. Gleich
- WAW
- 2013

We consider random-walk transition matrices from large social and information networks. For these matrices, we describe and evaluate a fast method to estimate one column of the matrix exponential. Our method runs in sublinear time on networks where the maximum degree grows doubly logarithmic with respect to the number of nodes. For collaboration networks… (More)

- Kyle Kloster, David F. Gleich
- ArXiv
- 2015

Personalized PageRank vectors used for many community detection and graph diffusion problems have a subtle dependence on a parameter epsilon that controls their accuracy. This parameter governs the sparsity of the solution and can be interpreted as a regularization parameter. We study algorithms to estimate the solution path as a function of the sparsity… (More)

- Kyle Kloster, David F. Gleich
- ArXiv
- 2013

- Huda Nassar, Kyle Kloster, David F. Gleich
- WAW
- 2015

The personalized PageRank diffusion is a fundamental tool in network analysis tasks like community detection and link prediction. This tool models the spread of a quantity from a small, initial set of seed nodes, and has long been observed to stay localized near this seed set. We derive a sublinear upper-bound on the number of nonzeros necessary to… (More)

- K L Kloster, M M Judy, J L Matthews, R E Utecht, J A Burbach, K J Vaska
- Lasers in surgery and medicine
- 2000

BACKGROUND AND OBJECTIVE
We are currently working with a novel class of photoactivated 4-amino substituted 1,8-naphthalimide compounds for tissue bonding. With promising results in other tissues, we are pursuing potential vascular applications. This study focused on determining the appropriate compound formulation(s), concentration, and exposure times to… (More)

- Kyle Kloster, Philipp Kuinke, +4 authors Andrew van der Poel
- ArXiv
- 2017

The Flow Decomposition problem, which asks for the smallest set of weighted paths that “covers” a flow on a DAG, has recently been used as an important computational step in genetic assembly problems. We prove the problem is in FPT when parameterized by the number of paths, and we give a practical linear fpt algorithm. Combining this approach with algorithm… (More)

Identifying communities plays a central role in understanding the structure of large networks. As practitioners analyze progressively larger networks, it becomes increasingly important to understand the computational complexity of candidate algorithms. We examine the complexity of the link clustering algorithm (Ahn et al., 2010) for overlapping community… (More)