@conference {17181,
	title = {Group-in-a-Box Layout for Multi-faceted Analysis of Communities},
	booktitle = {Privacy, Security, Risk and Trust (PASSAT), 2011 IEEE Third International Conference on and 2011 IEEE Third International Confernece on Social Computing (SocialCom)},
	year = {2011},
	month = {2011/10/09/11},
	pages = {354 - 361},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Communities in social networks emerge from interactions among individuals and can be analyzed through a combination of clustering and graph layout algorithms. These approaches result in 2D or 3D visualizations of clustered graphs, with groups of vertices representing individuals that form a community. However, in many instances the vertices have attributes that divide individuals into distinct categories such as gender, profession, geographic location, and similar. It is often important to investigate what categories of individuals comprise each community and vice-versa, how the community structures associate the individuals from the same category. Currently, there are no effective methods for analyzing both the community structure and the category-based partitions of social graphs. We propose Group-In-a-Box (GIB), a meta-layout for clustered graphs that enables multi-faceted analysis of networks. It uses the tree map space filling technique to display each graph cluster or category group within its own box, sized according to the number of vertices therein. GIB optimizes visualization of the network sub-graphs, providing a semantic substrate for category-based and cluster-based partitions of social graphs. We illustrate the application of GIB to multi-faceted analysis of real social networks and discuss desirable properties of GIB using synthetic datasets.},
	keywords = {Algorithm design and analysis, category based social graph partitions, clustered graphs, clustering, Clustering algorithms, Communities, data visualisation, force-directed, gender, geographic location, graph layout algorithms, graph theory, group-in-a-box, group-in-a-box layout, Image edge detection, Layout, meta-layout, multifaceted community analysis, network subgraph visualization, network visualization, pattern clustering, profession, semantic substrates, Social network services, social networking (online), social networks, treemap space filling technique, Visualization},
	isbn = {978-1-4577-1931-8},
	doi = {10.1109/PASSAT/SocialCom.2011.139},
	author = {Rodrigues,E.M. and Milic-Frayling,N. and Smith,M. and Shneiderman, Ben and Hansen,D.}
}
@conference {17653,
	title = {Rigorous Probabilistic Trust-Inference with Applications to Clustering},
	booktitle = {IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technologies, 2009. WI-IAT {\textquoteright}09},
	volume = {1},
	year = {2009},
	month = {2009/09/15/18},
	pages = {655 - 658},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {The World Wide Web has transformed into an environment where users both produce and consume information. In order to judge the validity of information, it is important to know how trustworthy its creator is. Since no individual can have direct knowledge of more than a small fraction of information authors, methods for inferring trust are needed. We propose a new trust inference scheme based on the idea that a trust network can be viewed as a random graph, and a chain of trust as a path in that graph. In addition to having an intuitive interpretation, our algorithm has several advantages, noteworthy among which is the creation of an inferred trust-metric space where the shorter the distance between two people, the higher their trust. Metric spaces have rigorous algorithms for clustering, visualization, and related problems, any of which is directly applicable to our results.},
	keywords = {Clustering algorithms, Conferences, Educational institutions, Extraterrestrial measurements, Inference algorithms, Intelligent agent, random graphs, Social network services, trust inferrence, Visualization, Voting, Web sites},
	isbn = {978-0-7695-3801-3},
	doi = {10.1109/WI-IAT.2009.109},
	author = {DuBois,Thomas and Golbeck,Jennifer and Srinivasan, Aravind}
}
@article {17913,
	title = {Unsupervised learning applied to progressive compression of time-dependent geometry},
	journal = {Computers \& Graphics},
	volume = {29},
	year = {2005},
	month = {2005/06//},
	pages = {451 - 461},
	abstract = {We propose a new approach to progressively compress time-dependent geometry. Our approach exploits correlations in motion vectors to achieve better compression. We use unsupervised learning techniques to detect good clusters of motion vectors. For each detected cluster, we build a hierarchy of motion vectors using pairwise agglomerative clustering, and succinctly encode the hierarchy using entropy encoding. We demonstrate our approach on a client{\textendash}server system that we have built for downloading time-dependent geometry.},
	keywords = {Clustering algorithms, Distributed/network graphics, pattern recognition},
	isbn = {0097-8493},
	doi = {10.1016/j.cag.2005.03.021},
	url = {http://www.sciencedirect.com/science/article/pii/S009784930500052X},
	author = {Baby,Thomas and Kim,Youngmin and Varshney, Amitabh}
}
@conference {14811,
	title = {Automated cluster-based Web service performance tuning},
	booktitle = {13th IEEE International Symposium on High performance Distributed Computing, 2004. Proceedings},
	year = {2004},
	month = {2004/06/04/6},
	pages = {36 - 44},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Active harmony provides a way to automate performance tuning. We apply the Active Harmony system to improve the performance of a cluster-based web service system. The performance improvement cannot easily be achieved by tuning individual components for such a system. The experimental results show that there is no single configuration for the system that performs well for all kinds of workloads. By tuning the parameters, Active Harmony helps the system adapt to different workloads and improve the performance up to 16\%. For scalability, we demonstrate how to reduce the time when tuning a large system with many tunable parameters. Finally an algorithm is proposed to automatically adjust the structure of cluster-based web systems, and the system throughput is improved up to 70\% using this technique.},
	keywords = {Active Harmony system, automated performance tuning, business, cluster-based Web service system, Clustering algorithms, Computer science, Educational institutions, electronic commerce, Internet, Middleware, performance evaluation, scalability, Throughput, Transaction databases, Web server, Web services, workstation clusters},
	isbn = {0-7695-2175-4},
	doi = {10.1109/HPDC.2004.1323484},
	author = {Chung,I. -H and Hollingsworth, Jeffrey K}
}
@conference {15690,
	title = {Automatic video summarization for wireless and mobile environments},
	booktitle = {2004 IEEE International Conference on Communications},
	volume = {3},
	year = {2004},
	month = {2004/06/20/24},
	pages = {1532- 1536 Vol.3 - 1532- 1536 Vol.3},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {In this paper, we propose a novel video summarization technique using which we can automatically generate high quality video summaries suitable for wireless and mobile environments. The significant contribution of this paper lies in the proposed clustering scheme. We use Delaunay diagrams to cluster multidimensional point data corresponding to the frame contents of the video. In contrast to the existing clustering techniques used for summarization, our clustering algorithm is fully automatic and well suited for batch processing. We illustrate the quality of our clustering and summarization scheme in an experiment using several video clips.},
	keywords = {automatic video summarization, batch processing, batch processing (computers), Clustering algorithms, Clustering methods, clustering scheme, Computer science, Delaunay diagram, graph theory, Gunshot detection systems, Image sequences, mesh generation, Mobile computing, mobile radio, multidimensional point data cluster, Multidimensional systems, Multimedia communication, video clip, video frame content, Video sequences, video signal processing, wireless mobile environment},
	isbn = {0-7803-8533-0},
	doi = {10.1109/ICC.2004.1312767},
	author = {Yong Rao and Mundur, Padma and Yesha,Y.}
}
@conference {17314,
	title = {Ordered treemap layouts},
	booktitle = {IEEE Symposium on Information Visualization, 2001. INFOVIS 2001},
	year = {2001},
	month = {2001///},
	pages = {73 - 78},
	publisher = {IEEE},
	organization = {IEEE},
	keywords = {Clustering algorithms, Computer science, Data visualization, Displays, Electronic switching systems, Filling, Monte Carlo methods, Read only memory, Testing},
	isbn = {0-7695-7342-5},
	doi = {10.1109/INFVIS.2001.963283},
	author = {Shneiderman, Ben and Wattenberg,M.}
}
