Open Access. Powered by Scholars. Published by Universities.®

2011

Discipline
Institution
Keyword
Publication
Publication Type

Articles 61 - 74 of 74

Full-Text Articles in Numerical Analysis and Scientific Computing

Mkboost: A Framework Of Multiple Kernel Boosting, Hao Xia, Steven C. H. Hoi Apr 2011

Mkboost: A Framework Of Multiple Kernel Boosting, Hao Xia, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

Multiple kernel learning (MKL) has been shown as a promising machine learning technique for data mining tasks by integrating with multiple diverse kernel functions. Traditional MKL methods often formulate the problem as an optimization task of learning both optimal combination of kernels and classifiers, and attempt to resolve the challenging optimization task by various techniques. Unlike the existing MKL methods, in this paper, we investigate a boosting framework of exploring multiple kernel learning for classification tasks. In particular, we present a novel framework of Multiple Kernel Boosting (MKBoost), which applies boosting techniques for learning kernel-based classifiers with multiple kernels. Based …


A Probabilistic Analysis Of Misparking In Reservation Based Parking Garages, Vikas G. Ashok Apr 2011

A Probabilistic Analysis Of Misparking In Reservation Based Parking Garages, Vikas G. Ashok

Computer Science Theses & Dissertations

Parking in major cities is an expensive and annoying affair, the reason ascribed to the limited availability of parking space. Modern parking garages provide parking reservation facility, thereby ensuring availability to prospective customers. Misparking in such reservation based parking garages creates confusion and aggravates driver frustration. The general conception about misparking is that it tends to completely cripple the normal functioning of the system leading to chaos and confusion. A single mispark tends to have a ripple effect and therefore spawns a chain of misparks. The chain terminates when the last mispark occurs at the parking slot reserved by the …


Comparing Twitter And Traditional Media Using Topic Models, Wayne Xin Zhao, Jing Jiang, Jianshu Weng, Jing He, Ee Peng Lim, Hongfei Yan, Xiaoming Li Apr 2011

Comparing Twitter And Traditional Media Using Topic Models, Wayne Xin Zhao, Jing Jiang, Jianshu Weng, Jing He, Ee Peng Lim, Hongfei Yan, Xiaoming Li

Research Collection School Of Computing and Information Systems

Twitter as a new form of social media can potentially contain much useful information, but content analysis on Twitter has not been well studied. In particular, it is not clear whether as an information source Twitter can be simply regarded as a faster news feed that covers mostly the same information as traditional news media. In This paper we empirically compare the content of Twitter with a traditional news medium, New York Times, using unsupervised topic modeling. We use a Twitter-LDA model to discover topics from a representative sample of the entire Twitter. We then use text mining techniques to …


Multi-Objective Zone Mapping In Large-Scale Distributed Virtual Environments, Nguyen Binh Duong Ta, Suiping Zhou, Wentong Cai, Xueyan Tang, Rassul Avani Mar 2011

Multi-Objective Zone Mapping In Large-Scale Distributed Virtual Environments, Nguyen Binh Duong Ta, Suiping Zhou, Wentong Cai, Xueyan Tang, Rassul Avani

Research Collection School Of Computing and Information Systems

In large-scale distributed virtual environments (DVEs), the NP-hard zone mapping problem concerns how to assign distinct zones of the virtual world to a number of distributed servers to improve overall interactivity. Previously, this problem has been formulated as a single-objective optimization problem, in which the objective is to minimize the total number of clients that are without QoS. This approach may cause considerable network traffic and processing overhead, as a large number of zones may need to be migrated across servers. In this paper, we introduce a multi-objective approach to the zone mapping problem, in which both the total number …


Mining Social Images With Distance Metric Learning For Automated Image Tagging, Pengcheng Wu, Steven C. H. Hoi, Peilin Zhao, Ying He Feb 2011

Mining Social Images With Distance Metric Learning For Automated Image Tagging, Pengcheng Wu, Steven C. H. Hoi, Peilin Zhao, Ying He

Research Collection School Of Computing and Information Systems

With the popularity of various social media applications, massive social images associated with high quality tags have been made available in many social media web sites nowadays. Mining social images on the web has become an emerging important research topic in web search and data mining. In this paper, we propose a machine learning framework for mining social images and investigate its application to automated image tagging. To effectively discover knowledge from social images that are often associated with multimodal contents (including visual images and textual tags), we propose a novel Unified Distance Metric Learning (UDML) scheme, which not only …


Interdisciplinary Computational Projects Utilizing The Hpc Cluster, Demos Athanasopoulos Jan 2011

Interdisciplinary Computational Projects Utilizing The Hpc Cluster, Demos Athanasopoulos

Cornerstone 3 Reports : Interdisciplinary Informatics

No abstract provided.


A Parallel Graph Sampling Algorithm For Analyzing Gene Correlation Networks, Kathryn Dempsey Cooper, Kanimathi Duraisamy, Hesham Ali, Sanjukta Bhowmick Jan 2011

A Parallel Graph Sampling Algorithm For Analyzing Gene Correlation Networks, Kathryn Dempsey Cooper, Kanimathi Duraisamy, Hesham Ali, Sanjukta Bhowmick

Interdisciplinary Informatics Faculty Publications

Effcient analysis of complex networks is often a challenging task due to its large size and the noise inherent in the system. One popular method of overcoming this problem is through graph sampling, that is extracting a representative subgraph from the larger network. The accuracy of the sample is validated by comparing the combinatorial properties of the subgraph and the original network. However, there has been little study in comparing networks based on the applications that they represent. Furthermore, sampling methods are generally applied agnostically, without mapping to the requirements of the underlying analysis. In this paper,we introduce a parallel …


In-Degree Dynamics Of Large-Scale P2p Systems, Zhongmei Yao, Daren B. H. Cline, Dmitri Loguinov Jan 2011

In-Degree Dynamics Of Large-Scale P2p Systems, Zhongmei Yao, Daren B. H. Cline, Dmitri Loguinov

Computer Science Faculty Publications

This paper builds a complete modeling framework for understanding user churn and in-degree dynamics in unstructured P2P systems in which each user can be viewed as a stationary alternating renewal process. While the classical Poisson result on the superposition of n stationary renewal processes for n→∞ requires that each point process become sparser as n increases, it is often difficult to rigorously show this condition in practice. In this paper, we first prove that despite user heterogeneity and non-Poisson arrival dynamics, a superposition of edge-arrival processes to a live user under uniform selection converges to a Poisson process when …


Evaluation Of Essential Genes In Correlation Networks Using Measures Of Centrality, Kathryn Dempsey Cooper, Hesham Ali Jan 2011

Evaluation Of Essential Genes In Correlation Networks Using Measures Of Centrality, Kathryn Dempsey Cooper, Hesham Ali

Interdisciplinary Informatics Faculty Proceedings & Presentations

Correlation networks are emerging as powerful tools for modeling relationships in high-throughput data such as gene expression. Other types of biological networks, such as protein-protein interaction networks, are popular targets of study in network theory, and previous analysis has revealed that network structures identified using graph theoretic techniques often relate to certain biological functions. Structures such as highly connected nodes and groups of nodes have been found to correspond to essential genes and protein complexes, respectively. The correlation network, which measures the level of co-variation of gene expression levels, shares some structural properties with other types of biological networks. We …


A Novel Correlation Networks Approach For The Identification Of Gene Targets, Kathryn Dempsey Cooper, Stephen Bonasera, Dhundy Raj Bastola, Hesham Ali Jan 2011

A Novel Correlation Networks Approach For The Identification Of Gene Targets, Kathryn Dempsey Cooper, Stephen Bonasera, Dhundy Raj Bastola, Hesham Ali

Interdisciplinary Informatics Faculty Proceedings & Presentations

Correlation networks are emerging as a powerful tool for modeling temporal mechanisms within the cell. Particularly useful in examining coexpression within microarray data, studies have determined that correlation networks follow a power law degree distribution and thus manifest properties such as the existence of “hub” nodes and semicliques that potentially correspond to critical cellular structures. Difficulty lies in filtering coincidental relationships from causative structures in these large, noise-heavy networks. As such, computational expenses and algorithm availability limit accurate comparison, making it difficult to identify changes between networks. In this vein, we present our work identifying temporal relationships from microarray data …


A Noise Reducing Sampling Approach For Uncovering Critical Properties In Large Scale Biological Networks, Karthik Duraisamy, Kathryn Dempsey Cooper, Hesham Ali, Sanjukta Bhowmick Jan 2011

A Noise Reducing Sampling Approach For Uncovering Critical Properties In Large Scale Biological Networks, Karthik Duraisamy, Kathryn Dempsey Cooper, Hesham Ali, Sanjukta Bhowmick

Interdisciplinary Informatics Faculty Proceedings & Presentations

A correlation network is a graph-based representation of relationships among genes or gene products, such as proteins. The advent of high-throughput bioinformatics has resulted in the generation of volumes of data that require sophisticated in silico models, such as the correlation network, for in-depth analysis. Each element in our network represents expression levels of multiple samples of one gene and an edge connecting two nodes reflects the correlation level between the two corresponding genes in the network according to the Pearson correlation coefficient. Biological networks made in this manner are generally found to adhere to a scale-free structural nature, that …


Housing With Support Marketing Study Tool, Gary M. Travis Jan 2011

Housing With Support Marketing Study Tool, Gary M. Travis

All Graduate Theses, Dissertations, and Other Capstone Projects

Housing for persons with serious mental illness (SMI) that is permanent, affordable, and supportive is very limited because the availability of these resources is inadequate and subject to significant demand by persons that are disabled or on a limited income. The limited access to housing for persons with SMI is contributing to homelessness and Minnesota has seen a steady rise since 1994 in the rate and number of people that are homeless and coping with mental illness (Wilder Research, 2010a). While some of the impact of disability, homelessness, and limited affordable housing access is known, what remains uncertain is a …


Real-Time Road Traffic Prediction With Spatio-Temporal Correlations, Wanli Min, Laura Wynter Jan 2011

Real-Time Road Traffic Prediction With Spatio-Temporal Correlations, Wanli Min, Laura Wynter

Research Collection School Of Computing and Information Systems

Real-time road traffic prediction is a fundamental capability needed to make use of advanced, smart transportation technologies. Both from the point of view of network operators as well as from the point of view of travelers wishing real-time route guidance, accurate short-term traffic prediction is a necessary first step. While techniques for short-term traffic prediction have existed for some time, emerging smart transportation technologies require the traffic prediction capability to be both fast and scalable to full urban networks. We present a method that has proven to be able to meet this challenge. The method presented provides predictions of speed …


Why Is An Einstein Ring Blue?, Jonathan Blackledge Jan 2011

Why Is An Einstein Ring Blue?, Jonathan Blackledge

Articles

Albert Einstein predicted the existence of `Einstein rings' as a consequence of his general theory of relativity. The phenomenon is a direct result of the idea that if a mass warps space-time then light (and other electromagnetic waves) will be `lensed' by the strong gravitational field produced by a large cosmological body such as a galaxy. Since 1998, when the first complete Einstein ring was observed, many more complete or partially complete Einstein rings have been observed in the radio and infrared spectra, for example, and by the Hubble Space Telescope in the optical spectrum. However, in the latter case, …