#### Filter Results:

- Full text PDF available (50)

#### Publication Year

1990

2017

- This year (3)
- Last 5 years (19)
- Last 10 years (34)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Yuan An, Jeannette C. M. Janssen, Evangelos E. Milios
- Knowledge and Information Systems
- 2003

Citation graphs representing a body of scientific literature convey measures of scholarly activity and productivity. In this work we present a study of the structure of the citation graph of the computer science literature. Using a web robot we built several topic-specific citation graphs and their union graph from the digital library ResearchIndex. After… (More)

In this paper, we develop a general framework for studying distributed online frequency assignmentin cellular networks. The problem can be abstracted as a multicoloring problem on a node-weighted graph whose weights change over time. The graph, with nodes corresponding to network cells, is usually modeled as a subgraph of the triangular lattice and the… (More)

- Roland Häggkvist, Jeannette C. M. Janssen
- Combinatorics, Probability & Computing
- 1997

- Jeannette C. M. Janssen, Matt Hurshman, Nauzer Kalyaniwalla
- Internet Mathematics
- 2012

Several network models have been proposed to explain the link structure observed in online social networks. This paper addresses the problem of choosing the model that best fits a given real world network. We implement a model selection method based on un-supervised learning. An alternating decision tree is trained using synthetic graphs generated according… (More)

We present a new stochastic model for complex networks, based on a spatial embedding of the nodes, called the Spatial Preferred Attachment (SPA) model. In the SPA model, nodes have influence regions of varying size, and new nodes may only link to a node if they fall within its influence region. The spatial embedding of the nodes models the background… (More)

- Anthony Bonato, Jeannette C. M. Janssen
- Internet Mathematics
- 2003

Several stochastic models were proposed recently to model the dynamic evolution of the web graph. We study the infinite limits of the stochastic processes proposed to model the web graph when time goes to infinity. We prove that deterministic variations of the so-called copying model can lead to several nonisomorphic limits. Some models converge to the… (More)

- Jeannette C. M. Janssen
- J. Comb. Theory, Ser. A
- 1995

Latin squares can be classified as odd or even according to the signs of the permutations given by their rows and columns. In this paper, the behaviour of the parities of a latin square under the action of the isotopy group (permuting rows, columns, and symbols) and the transformation group (interchanging rows, columns, and symbols) is analyzed. A rule is… (More)

- Wangzhong Lu, Jeannette C. M. Janssen, Evangelos E. Milios, Nathalie Japkowicz, Yongzheng Zhang
- Knowledge and Information Systems
- 2006

Published scientific articles are linked together into a graph, the citation graph, through their citations. This paper explores the notion of similarity based on connectivity alone, and proposes several algorithms to quantify it. Our metrics take advantage of the local neighborhoods of the nodes in the citation graph. Two variants of link-based similarity… (More)

- Hongyu Liu, Jeannette C. M. Janssen, Evangelos E. Milios
- Data Knowl. Eng.
- 2006

A focused crawler is designed to traverse the Web to gather documents on a specific topic. It can be used to build domain-specific Web search portals and online personalized search tools. To estimate the relevance of a newly seen URL, it must use information gleaned from previously crawled page sequences. In this paper, we present a new approach for… (More)

We study the link structure of on-line social networks (OSNs), and introduce a new model for such networks which may help infer their hidden underlying reality. In the geo-protean (GEO-P) model for OSNs nodes are identified with points in Euclidean space, and edges are stochastically generated by a mixture of the relative distance of nodes and a ranking… (More)