#### Filter Results:

- Full text PDF available (46)

#### Publication Year

1996

2018

- This year (1)
- Last 5 years (12)
- Last 10 years (31)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

#### Organism

Learn More

- Chuntao Jiang, Frans Coenen, Michele Zito
- Knowledge Eng. Review
- 2013

Graph mining is an important research area within the domain of data mining. The field of study concentrates on the identification of frequent subgraphs within graph data sets. The research goals are directed at: (i) effective mechanisms for generating candidate subgraphs (without generating duplicates) and (ii) how best to process the generated candidate… (More)

- William Duckworth, David Manlove, Michele Zito
- J. Discrete Algorithms
- 2005

In this paper we consider the approximability of the maximum induced matching problem (MIM). We give an approximation algorithm with asymptotic performance ratio d − 1 for MIM in d-regular graphs, for each d ≥ 3. We also prove that MIM is APXcomplete in d-regular graphs, for each d ≥ 3.

- Michele Zito
- WG
- 1999

- I. Adam, R. Aleksan, +93 authors M. Zito
- 2004

I. Adam, R. Aleksan, L. Amerman, E. Antokhin, D. Aston, P. Bailly, C. Beigbeder, M. Benkebil, P. Besson, G. Bonneaud, Ph. Bourgeois, D. Breton, H. Briand, F. Brochard, D. N. Brown, A. Buzykaev, J. Chauveau, R. Cizeron, J. Cohen-Tanugi, M. Convery, S. Dardin, P. David, G. De Domenico, C. de la Vaissiere, A. de Lesquen, F. Dohou, M. Doser, S. Emery, S.… (More)

Geographic profilers have access to a repertoire of strategies for predicting a serial offender’s home location. These strategies range in complexity—some involve more calculations to implement than others—and the assumption often made is that more complex strategies will outperform simpler strategies. In the present study, we tested the relationship… (More)

- William Duckworth, Nicholas C. Wormald, Michele Zito
- J. Discrete Algorithms
- 2003

- Chuntao Jiang, Frans Coenen, Robert Sanderson, Michele Zito
- SGAI Conf.
- 2009

A graph-based approach to document classification is described in this paper. The graph representation offers the advantage that it allows for a much more expressive document encoding than the more standard bag of words/phrases approach, and consequently gives an improved classification accuracy. Document sets are represented as graph sets to which a… (More)

- Michele Zito
- ESA
- 2001

In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the minimum vertex cover (MVC), minimum independent dominating set (MIDS) and minimum edge dominating set (MEDS) problems. In almost all cases we are able to improve the best known… (More)

- Sante D Pierdomenico, Giuseppe Pannarale, +7 authors Franco Cuccurullo
- American journal of hypertension
- 2008

BACKGROUND
The prognostic impact of masked hypertension is not yet completely clear. The aim of this study was to evaluate the prognostic relevance of masked hypertension in subjects with prehypertension.
METHODS
The occurrence of fatal and nonfatal cardiovascular events was evaluated in 591 subjects with prehypertension defined as clinic blood pressure… (More)

- Chuntao Jiang, Frans Coenen, Michele Zito
- DaWak
- 2010

Frequent sub-graph mining entails two significant overheads. The first is concerned with candidate set generation. The second with isomorphism checking. These are also issues with respect to other forms of frequent pattern mining but are exacerbated in the context of frequent sub-graph mining. To reduced the search space, and address these twin overheads, a… (More)