Learn More
Exploratory data analysis is increasingly more necessary as larger spatial data is managed in electro-magnetic media. We propose an exploratory method that reveals a robust clustering hierarchy. Our approach uses the Delaunay diagram to incorporate spatial proximity. It does not require any prior knowledge about the data set, nor does it require parameters(More)
We incorporate two knowledge discovery techniques, clustering and association-rule mining, into a fruitful exploratory tool for the discovery of spatio-temporal patterns. This tool is an autonomous pattern detector to reveal plausible cause-effect associations between layers of point and area data. We present two methods for this exploratory analysis and we(More)
Agile scrum software development has attracted a great deal of attention in recent years due to its flexibility, responsiveness and reliability. This article extends it to multi-vendor competing situations, and introduces a collaborative framework for agile scrum development. A case study confirms the usefulness and applicability of the proposed framework.
With the development of web technique and social network sites human now can produce information, share with others online easily. Photo-sharing website, Flickr, stores huge number of photos where people upload and share their pictures. This research proposes a framework that is used to extract associative points-of-interest patterns from geo-tagged photos(More)
Interpretability and usability of clustering results are of fundamental importance. A linear time method for transforming point clusters into polygons is explored. This method automatically translates a point data layer into a space filling layer where clusters are identified as some of the resulting regions. The method is based on robustly identifying(More)
This paper describes a series of dynamic update methods that can be applied to a family of Voronoi diagram types, so that changes can be updated incrementally, without the usual recourse to complete reconstruction of their underlying data structure. More efficient incremental update methods are described for the ordinary Voronoi diagram, the farthest-point(More)