Jianhua Yang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Jianhua Yang has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Vladimir Estivill-Castro
Universitat Pompeu Fabra
5 shared publications Bhuvan Unhelkar
School of Computing & Mathematics, University of Western Sydney, NSW 2560, Australia
1 shared publication- Stephan K. Chalup
School of Computer and Information Sciences University of Newcastle Callaghan New South Wales Australia
1 shared publication
Latest Publications
- 1 May 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 101-108
Iterative class diagram construction in consideration of modeling granularity
This paper presents an effective and efficient class modeling approach in light of granularity of software architecture. While class model constructions have discussed architectural and process principles, in this paper we highlight the concept of granularity and the resultant iterative manner of class modelling wherein modeling tasks are carried out iteratively and where technical details are added gradually. As a part of this granular approach, class relationships and their semantics are also enriched gradually by identifying intra-family and inter-family relationships in the large, and identifying attribute-level and method level associations in the small. Modeling aspects of class diagrams at different abstraction levels have been examined, which can be used for effective class model construction and verification. Furthermore, we suggest the use of adornments to clarify sophisticated features of a class, and leave implementation specific aspects to implementation views. Such approach, we hope will obviate the trap of over modelling with implementation specific details in early stages.
- 1 May 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 101-108
Iterative class diagram construction in consideration of modeling granularity
This paper presents an effective and efficient class modeling approach in light of granularity of software architecture. While class model constructions have discussed architectural and process principles, in this paper we highlight the concept of granularity and the resultant iterative manner of class modelling wherein modeling tasks are carried out iteratively and where technical details are added gradually. As a part of this granular approach, class relationships and their semantics are also enriched gradually by identifying intra-family and inter-family relationships in the large, and identifying attribute-level and method level associations in the small. Modeling aspects of class diagrams at different abstraction levels have been examined, which can be used for effective class model construction and verification. Furthermore, we suggest the use of adornments to clarify sophisticated features of a class, and leave implementation specific aspects to implementation views. Such approach, we hope will obviate the trap of over modelling with implementation specific details in early stages.
- 1 March 2004
- Published by Springer Nature in Data Mining and Knowledge Discovery
- Vol. 8 (2) , 127-150
Fast and Robust General Purpose Clustering Algorithms
- 1 March 2004
- Published by Springer Nature in Data Mining and Knowledge Discovery
- Vol. 8 (2) , 127-150
Fast and Robust General Purpose Clustering Algorithms
- 1 August 2002
- Published by World Scientific Pub Co Pte Ltd in International Journal of Foundations of Computer Science
- Vol. 13 (04) , 497-520
CLUSTERING WEB VISITORS BY BAST, ROBUST AND CONVERGENT ALGORITHMS
The identification of categories of visitors to a Web-site is very useful towards improved Web designs and improved Web applications. However, the large volume involved in mining access-logs and visitation paths, and the uncertainty to fully identify the visitor demand efficient clustering algorithms that are also resistant to noise and outliers. Also, visitation paths are discrete, and dissimilarity between visitation paths involves sophisticated evaluation and results in attribute-vectors with large dimension. We provide randomized, iterative clustering algorithms for generic dissimilarity in paths. Our algorithms are robust because they use medians rather than means as estimators of location, and the resulting representative of a cluster is actually a path in the data set. We demonstrate mathematically that our algorithms converge and have subquadratic complexity. We also show experimentally that they are resistant to noise by recovering clusters from synthetic data generated by a mixture of distributions of paths in a graph. Our non-crisp method proposed generalizes approaches that allow a data item to have a degree of membership in a cluster.
- 1 August 2002
- Published by World Scientific Pub Co Pte Ltd in International Journal of Foundations of Computer Science
- Vol. 13 (04) , 497-520
CLUSTERING WEB VISITORS BY BAST, ROBUST AND CONVERGENT ALGORITHMS
The identification of categories of visitors to a Web-site is very useful towards improved Web designs and improved Web applications. However, the large volume involved in mining access-logs and visitation paths, and the uncertainty to fully identify the visitor demand efficient clustering algorithms that are also resistant to noise and outliers. Also, visitation paths are discrete, and dissimilarity between visitation paths involves sophisticated evaluation and results in attribute-vectors with large dimension. We provide randomized, iterative clustering algorithms for generic dissimilarity in paths. Our algorithms are robust because they use medians rather than means as estimators of location, and the resulting representative of a cluster is actually a path in the data set. We demonstrate mathematically that our algorithms converge and have subquadratic complexity. We also show experimentally that they are resistant to noise by recovering clusters from synthetic data generated by a mixture of distributions of paths in a graph. Our non-crisp method proposed generalizes approaches that allow a data item to have a degree of membership in a cluster.
- 1 January 2002
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 898-903
Support vector clustering through proximity graph modelling
Support vector machines (SVMs) have been widely adopted for classification, regression and novelty detection. Recent studies (A. Ben-Hur et al., 2001) proposed to employ them for cluster analysis too. The basis of this support vector clustering (SVC) is density estimation through SVM training. SVC is a boundary-based clustering method, where the support information is used to construct cluster boundaries. Despite its ability to deal with outliers, to handle high dimensional data and arbitrary boundaries in data space, there are two problems in the process of cluster labelling. The first problem is its low efficiency when the number of free support vectors increases. The other problem is that it sometimes produces false negatives. We propose a robust cluster assignment method that harvests clustering results efficiently. Our method uses proximity graphs to model the proximity structure of the data. We experimentally analyze and illustrate the performance of this new approach.
- 1 January 2002
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 898-903
Support vector clustering through proximity graph modelling
Support vector machines (SVMs) have been widely adopted for classification, regression and novelty detection. Recent studies (A. Ben-Hur et al., 2001) proposed to employ them for cluster analysis too. The basis of this support vector clustering (SVC) is density estimation through SVM training. SVC is a boundary-based clustering method, where the support information is used to construct cluster boundaries. Despite its ability to deal with outliers, to handle high dimensional data and arbitrary boundaries in data space, there are two problems in the process of cluster labelling. The first problem is its low efficiency when the number of free support vectors increases. The other problem is that it sometimes produces false negatives. We propose a robust cluster assignment method that harvests clustering results efficiently. Our method uses proximity graphs to model the proximity structure of the data. We experimentally analyze and illustrate the performance of this new approach.
- 19 October 2001
- Published by Springer Nature
- p. 498-507
Categorizing Visitors Dynamically by Fast and Robust Clustering of Access Logs
- 19 October 2001
- Published by Springer Nature
- p. 498-507
Categorizing Visitors Dynamically by Fast and Robust Clustering of Access Logs