Wenyuan Dai, Yuqiang Chen, Qiang Yang, Yong Yu
This paper investigates a new machine learning strategy called translated learning. Unlike many previous learning tasks, we focus on how to use labeled data from one feature space to enhance the...
CIGAR: Concurrent and Interleaving Goal and Activity Recognition (2009)
In artificial intelligence and pervasive computing research, inferring users ’ high-level goals from activity sequences is an important task. A major challenge in goal recognition is that users...
Dirichlet Component Analysis: Feature Extraction for Compositional Data (2009)
Hua-yan Wang, Qiang Yang, Hong Qin, Hongbin Zha
We consider feature extraction (dimensionality reduction) for compositional data, where the data vectors are constrained to be positive and constant-sum. In real-world problems, the data components...
Wenyuan Dai, Qiang Yang, Gui-rong Xue, Yong Yu
This paper focuses on a new clustering task, called self-taught clustering. Self-taught clustering is an instance of unsupervised transfer learning, which aims at clustering a small collection of...
Transferring Multi-device Localization Models using Latent Multi-task Learning ∗ (2009)
Vincent Wenchen Zheng, Sinno Jialin Pan, Qiang Yang, Jeffrey Junfeng Pan
In this paper, we propose a latent multi-task learning algorithm to solve the multi-device indoor localization problem. Traditional indoor localization systems often assume that the collected signal...
Constraint Projections for Ensemble Learning (2009)
Daoqiang Zhang, Songcan Chen, Zhi-hua Zhou, Qiang Yang
It is well-known that diversity among base classifiers is crucial for constructing a strong ensemble. Most existing ensemble methods obtain diverse individual learners through resampling the...
Real World Activity Recognition with Multiple Goals (2009)
Derek Hao Hu, Sinno Jialin Pan, Vincent Wenchen Zheng, Nathan Nan Liu, Qiang Yang
Recognizing and understanding the activities of people from sensor readings is an important task in ubiquitous computing. Activity recognition is also a particularly difficult task because of the...
Transferring Localization Models Across Space (2009)
Sinno Jialin Pan, Dou Shen, Qiang Yang, James T. Kwok
Machine learning approaches to indoor WiFi localization involve an offline phase and an online phase. In the offline phase, data are collected from an environment to build a localization model, which...
Adaptive p-Posterior Mixture-Model Kernels for Multiple Instance Learning (2009)
Hua-yan Wang, Qiang Yang, Hongbin Zha
In multiple instance learning (MIL), how the instances determine the bag-labels is an essential issue, both algorithmically and intrinsically. In this paper, we show that the mechanism of how the...
Transferring Localization Models Over Time ∗ (2009)
Vincent Wenchen Zheng, Evan Wei Xiang, Qiang Yang, Dou Shen
Learning-based localization methods typically consist of an offline phase to collect the wireless signal data to build a statistical model, and an online phase to apply the model on new data. Many of...
Microsoft Adcenter Labs (2009)
Jie Yin, Csiro Ict Centre, Qiang Yang, Dou Shen, Ze-nian Li
A major issue of activity recognition in sensor networks is automatically recognizing a user’s highlevel goals accurately from low-level sensor data. Traditionally, solutions to this problem...
ABSTRACT Personal Name Classification in Web Queries (2009)
Dou Shen, Toby Walker, Zijian Zheng, Qiang Yang, Ying Li
Personal names are an important kind of Web queries in Web search, and yet they are special in many ways. Strategies for retrieving information on personal names should therefore be different from...
ABSTRACT Spectral Domain-Transfer Learning (2009)
Xiao Ling, Wenyuan Dai, Gui-rong Xue, Qiang Yang, Yong Yu
Traditional spectral classification has been proved to be effective in dealing with both labeled and unlabeled data when these data are from the same domain. In many real world applications, however,...
Dikan Xing, Gui-rong Xue, Qiang Yang, Yong Yu
Organizing Web search results into hierarchical categories facilitates users ’ browsing through Web search results, especially for ambiguous queries where the potential results are mixed together....
Deep Classification in Large-scale Text Hierarchies (2009)
Gui-rong Xue, Dikan Xing, Qiang Yang, Yong Yu
Most classification algorithms are best at categorizing the Web documents into a few categories, such as the top two levels in the Open Directory Project. Such a classification method does not give...
Topic-bridged PLSA for Cross-Domain Text Classification (2009)
Gui-rong Xue, Wenyuan Dai, Qiang Yang, Yong Yu
In many Web applications, such as blog classification and newsgroup classification, labeled data are in short supply. It often happens that obtaining labeled data in a new domain is expensive and...
Abstract Plan Mining by Divide-and-Conquer (2009)
Jiawei Han, Qiang Yang, Edward Kim
Plans or sequences of actions are an important form of data. With the proliferation of database technology, plan databases (or planbases) are increasingly common. E cient discovery of important...
Yan Fu, Ruixiang Sun, Qiang Yang, Simin He, Chunli Wang, Haipeng Wang, ...
This paper describes our solution for the protein homology prediction task in KDD Cup 2004 competition. This task is modeled as a supervised learning problem with multiple performance metrics....
ABSTRACT Building Bridges for Web Query Classification (2009)
Dou Shen, Jian-tao Sun, Qiang Yang, Zheng Chen
Web query classification (QC) aims to classify Web users’ queries, which are often short and ambiguous, into a set of target categories. QC has many applications including page ranking in Web...
Mining Web Logs to Improve Web Caching and (2009)
Qiang Yang, Henry Haining Zhang, Ye Lu
Abstract. Caching and prefetching are well known strategies for improving the performance of Internet systems. The heart of a caching system is its page replacement policy, which selects the pages to...
Jun Yan, Benyu Zhang, Ning Liu, Shuicheng Yan, Qiansheng Cheng, Weiguo Fan, ...
Abstract—Dimensionality reduction is an essential data preprocessing technique for large-scale and streaming data classification tasks. It can be used to improve both the efficiency and the...
Semi-supervised protein subcellular localization (2009)
Xu, Qian, Hu, Derek, Xue, Hong, Yu, Weichuan, Yang, Qiang
Abstract Background Protein subcellular localization is concerned with predicting the location of a protein within a cell using computational method. The location information can indicate key...
Wan, Xiang, Yang, Can, Yang, Qiang, Xue, Hong, Tang, Nelson LS, Yu, Weichuan
Abstract Background The interactions of multiple single nucleotide polymorphisms (SNPs) are highly hypothesized to affect an individual's susceptibility to complex diseases. Although many works have...
Yang, Can, He, Zengyou, Wan, Xiang, Yang, Qiang, Xue, Hong, Yu, Weichuan
Motivation: Hundreds of thousands of single nucleotide polymorphisms (SNPs) are available for genome-wide association (GWA) studies nowadays. The epistatic interactions of SNPs are believed to be...
The Seventh Asia Pacific Bioinformatics Conference (APBC 2009) (2009)
Bmc Bioinformatics, Qian Xu, Derek Hao Hu, Hong Xue, Weichuan Yu, Qiang Yang, ...
endoplasmic reticulum, cell nucleus and Golgi apparatus. These compartments play different roles, for instance, mitochondria supply chemical energy ATP for cell survive; chloroplasts transform light...
BMC Bioinformatics BioMed Central Methodology article (2009)
Xiang Wan, Can Yang, Qiang Yang, Hong Xue, Nelson Ls Tang, Weichuan Yu
MegaSNPHunter: a learning approach to detect disease predisposition SNPs and high level interactions in genome wide association study
Ke Wang, Qiang Yang, Senqiang Zhou, Jack Man, Shun Yeung
Direct marketing is a modern business activity with an aim to maximize the profit generated from market-ing to a selected group of customers. A key to direct marketing is to select a right subset of...
Accurate and Low-cost Location Estimation Using Kernels (2008)
Jeffery Junfeng, Pan James, T. Kwok, Qiang Yang, Yiqiang Chen
We present a novel method for indoor-location estimation using a vector-space model based on signals received from a wireless client. Our aim is to obtain an accurate mapping between the signal space...
Deriving a Stationary Dynamic Bayesian Network from a Logic Program with Recursive Loops (2008)
Abstract. Recursive loops in a logic program present a challenging problem to the PLP framework. On the one hand, they loop forever so that the PLP backward-chaining inferences would never stop. On...
Activating Case-Based Reasoning with Active Databases (2008)
Abstract. Many of today’s CBR systems are passive in nature: they require human users to activate them manually and to provide information about the incoming problem explicitly. In this paper, we...
Semantic Sensor Net: An Extensible Framework (2008)
Lionel M. Ni, Yanmin Zhu, Jian Ma, Minglu Li, Qiong Luo, Yunhao Liu, ...
Abstract. Existing approaches for sensor networks suffer from a number of critical drawbacks. First, homogeneous deployments have been commonly assumed, but in practice multiple deployments of sensor...
Taylor Series Prediction: A Cache Replacement Policy Based on Second-Order Trend Analysis (2008)
Qiang Yang, Haining Henry Zhang, Hui Zhang
Caching is one of the most e ective techniques for improving the performance of Internet systems. The heart of a caching system is its page replacement policy, which decides which page to replace...
Jun Yan, Benyu Zhang, Ning Liu, Shuicheng Yan, Qiansheng Cheng, Weiguo Fan, ...
Abstract—Dimensionality reduction is an essential data preprocessing technique for large-scale and streaming data classification tasks. It can be used to improve both the efficiency and the...
Latent Friend Mining from Blog Data (2008)
Dou Shen, Jian-tao Sun, Qiang Yang, Zheng Chen
The rapid growth of blog (also known as “weblog”) data provides a rich resource for social community mining. In this paper, we put forward a novel research problem of mining the latent friends of...
Preprocessing for Mining Customer Relationship Management Databases (2008)
Junfeng Pan, Qiang Yang, Hong Kong, Yiming Yang, Lei Li, Frances Tianyi Li, ...
A staged preprocessing framework for cost-sensitive-data processing can help service providers identify customers who might switch to a competitor. D a t a M i n i n g
The Application of Case Based Reasoning on Q&A System (2008)
Peng Han, Rui-min Shen, Fan Yang, Qiang Yang
system is an important aiding tool for people to obtain knowledge and information from the Internet. In this paper, we introduce CBR (Case Based Reasoning) into traditional Q&A system to increase...
SANet: A Service-Agent Network for Call-Center Scheduling (2008)
Qiang Yang, Yong Wang, Zhong Zhang
Abstract—We consider a network of service-providing agents, where different agents have different capabilities, availability, and cost to solve problems. These characteristics are particularly...
Learning Adaptive Temporal Radio Maps for Signal-Strength-Based Location Estimation (2008)
Jie Yin, Qiang Yang, Senior Member, Lionel M. Ni
Abstract — In wireless networks, a client’s locations can be estimated using signal strength received from signal transmitters. Static fingerprint-based techniques are commonly used for location...
Mining competent case bases for case-based reasoning (2008)
Rong Pan, Qiang Yang, Sinno Jialin Pan
Case-based reasoning relies heavily on the availability of a highly competent case base to make high-quality decisions. However, good case bases are difficult to come by. In this paper, we present a...
Mining Web Query Hierarchies from Clickthrough Data (2008)
Dou Shen, Min Qin, Weizhu Chen, Qiang Yang, Zheng Chen
In this paper, we propose to mine query hierarchies from clickthrough data, which is within the larger area of automatic acquisition of knowledge from the Web. When a user submits a query to a search...
Mining Web Logs for Prediction Models in WWW Caching (2008)
Web caching and prefetching are well known strategies for improving the performance of Internet systems. When combined with web log mining, these strategies can decide to cache and prefetch web...
Shanghai Jiao-Tong University Shanghai, P.R.China (2008)
Xiaochuan Ni, Gui-rong Xue, Xiao Ling, Yong Yu, Qiang Yang
Weblogs have become a prevalent source of information for people to express themselves. In general, there are two genres of contents in weblogs. The first kind is about the webloggers’ personal...
Co-Localization from Labeled and Unlabeled Data Using Graph Laplacian (2008)
Jeffrey Junfeng Pan, Qiang Yang
This paper addresses the problem of recovering the locations of both mobile devices and access points from radio signals, a problem which we call colocalization, by exploiting both labeled and...
David W. Aha, David Mcsherry, Qiang Yang
A considerable amount of research in case-based reasoning (CBR) has recently focused on conversational CBR as a means of providing more effective support for interactive problem solving. We review...
Redundancy Detection in Semistructured Case (2008)
AbstractÐWith the dramatic proliferation of case-based reasoning systems in commercial applications, many case bases are now becoming legacy systems. They represent a significant portion of an...
Test-Cost Sensitive Classification on Data with Missing Values (2008)
Qiang Yang, Senior Member, Charles Ling, Xiaoyong Chai, Rong Pan
Abstract—In the area of cost-sensitive learning, inductive learning algorithms have been extended to handle different types of costs to better represent misclassification errors. Most of the...
AFramework for Automatic Problem Decomposition in Planning (2008)
Qiang Yang, Shuo Bai, Guiyou Qiu
An intelligent problem solver must be able to decompose a complex problem into simpler parts. A decomposition algorithm would not only be bene cial for traditional subgoal-oriented planning systems...
Mining of Web-Page Visiting Patterns with Continuous-Time Markov Models (2008)
Qiming Huang, Qiang Yang, Joshua Zhexue Huang, Michael K. Ng
Abstract. This paper presents a new prediction model for predicting when an online customer leaves a current page and which next Web page the customer will visit. The model can forecast the total...
ABSTRACT LEARNING SIMILARITY MEASURES IN NON-ORTHOGONAL SPACES (2008)
Ning Liu, Benyu Zhang, Jun Yan, Qiang Yang, Shuicheng Yan, Zheng Chen, ...
Many machine learning and data mining algorithms crucially rely on the similarity metrics. The Cosine similarity, which calculates the inner product of two normalized feature vectors, is one of the...
Detect and Track Latent Factors with Online Nonnegative Matrix Factorization (2008)
Bin Cao, Dou Shen, Jian-tao Sun, Xuanhui Wang, Qiang Yang, Zheng Chen
Detecting and tracking latent factors from temporal data is an important task. Most existing algorithms for latent topic detection such as Nonnegative Matrix Factorization (NMF) have been designed...
Personal Name Classification in Web queries (2008)
Dou Shen, Toby Walker, Zijian Zheng, Qiang Yang, Ying Li
� Goal: � To detect whether a Web query is a personal name, without referring to any other context information;
Zhong Su, Qiang Yang, Hongjiang Zhang, Xiaowei Xu, Yu-hen Hu, Shaoping Ma
Abstract. A great challenge for web site designers is how to ensure users ’ easy access to important web pages efficiently. In this paper we present a clustering-based approach to address this...
Estimating Location Using Wi-Fi (2008)
Qiang Yang, Sinno Jialin Pan, Vincent Wenchen Zheng, Qiang Yang, Sinno Jialin Pan, Vincent Wenchen Zheng
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying...
Algorithms, Experimentation (2008)
Dou Shen, Qiang Yang, Jian-tao Sun, Zheng Chen
Text message stream is a newly emerging type of Web data which is produced in enormous quantities with the popularity of Instant Messaging and Internet Relay Chat. It is beneficial for detecting the...
Jinyan Li, Qiang Yang, Senior Member
Abstract — Odds ratio, relative risk (risk ratio) and absolute risk reduction (risk difference) are biostatistics measurements that are widely used for identifying significant risk factors in...
Domain-Constrained Semi-Supervised Mining of Tracking Models in Sensor Networks ABSTRACT (2008)
Rong Pan, Junhui Zhao, Vincent Wenchen Zheng, Jeffrey Junfeng Pan, Dou Shen, Sinno Jialin Pan, ...
Accurate localization of mobile objects is a major research problem in sensor networks and an important data mining application. Specifically, the localization problem is to determine the location of...
Adding Semantics to Email Clustering (2008)
Hua Li, Dou Shen, Benyu Zhang, Zheng Chen, Qiang Yang
This paper presents a novel algorithm to cluster emails according to their contents and the sentence styles of their subject lines. In our algorithm, natural language processing techniques and...
Mining Quantitative Associations in Large Database* (2008)
Chenyong Hu, Yongji Wang, Benyu Zhang, Qiang Yang, Qing Wang, Jinhui Zhou, ...
Abstract. Association Rule Mining algorithms operate on a data matrix to derive association rule, discarding the quantities of the items, which contains valuable information. In order to make full...
Extracting actionable knowledge from decision trees (2008)
Qiang Yang, Senior Member, Jie Yin, Charles Ling, Rong Pan
Abstract—Most data mining algorithms and tools stop at discovered customer models, producing distribution information on customer profiles. Such techniques, when applied to industrial problems such...
Research Track Paper Co-clustering based Classification for Out-of-domain Documents ABSTRACT (2008)
Wenyuan Dai, Gui-rong Xue, Qiang Yang, Yong Yu
In many real world applications, labeled data are in short supply. It often happens that obtaining labeled data in a new domain is expensive and time consuming, while there may be plenty of labeled...
Ratio Rule Mining from Multiple Data Sources (2008)
Jun Yan, Ning Liu, Qiang Yang, Qiansheng Cheng
Abstract. Both multiple source data mining and streaming data mining problems have attracted much attention in the past decade. In contrast to traditional association-rule mining, to capture the...
Discriminative Regularization: A New Classifier Learning Method (2008)
Hui Xue, Songcan Chen, Qiang Yang
Regularization involves a large family of the state-of-the-art techniques in classifier learning. However, since traditional regularization methods essentially derive from ill-posed multivariate...
Jeffrey Junfeng Pan, Qiang Yang
This paper addresses the problem of recovering the locations of both mobile devices and access points from radio signals, a problem which we call colocalization, by exploiting both labeled and...
Diverse Topic Phrase Extraction from Text Collection (2008)
Jilin Chen, Benyu Zhang, Dou Shen, Qiang Yang, Zheng Chen, Qiansheng Cheng
Keyword extraction is an efficient approach to managing an explosion of online text on the Web. Traditionally, an abstraction of the online text is constructed though keywords, which are extracted...
Competence Driven Case-Base Mining (2008)
Rong Pan, Qiang Yang, Jeffrey Junfeng Pan, Lei Li
We present a novel algorithm for extracting a high-quality case base from raw data while preserving and sometimes improving the competence of case-based reasoning. We extend the framework of Smyth...
Feature selection is an important component of text categorization. This technique can both increase a classifier’s computation speed, and reduce the overfitting problem. Several feature selection...
Yonghong Tian, Qiang Yang, Tiejun Huang, Charles X. Ling, Wen Gao, Senior Member, ...
Abstract—Links among objects contain rich semantics that can be very helpful in classifying the objects. However, many irrelevant links can be found in real-world link data such as Web pages....
Chinese Academy of Sciences (2008)
Yi-dong Shen, Jia-huai You, Li-yan Yuan, Qiang Yang
We present a new characterization of termination of general logic programs. Most existing termination analysis approaches rely on some static information about the structure of the source code of a...
A Scalable Supervised Algorithm for Dimensionality Reduction on Streaming Data * (2008)
Jun Yan, Benyu Zhang, Shuicheng Yan, Ning Liu, Qiang Yang, Qiansheng Cheng, ...
Algorithms on streaming data have attracted increasing attention in the past decade. Among them, dimensionality reduction algorithms are greatly interesting due to the desirability of real tasks....
TrAdaBoost = Transfer AdaBoost Experimental Results Conclusion Boosting for Transfer Learning (2008)
LEAPS: A Location Estimation and Action Prediction System In a Wireless LAN Environment (2008)
Qiang Yang, Yiqiang Chen, Jie Yin, Xiaoyong Chai
Abstract. Location estimation and user behavior recognition are research issues that go hand in hand. In the past, these two issues have been investigated separately. In this paper, we present an...
A Nonlinear Scoring Framework for Peptide Identification via Tandem Mass Spectrometry (2008)
Yan Fu, Qiang Yang, Ruixiang Sun, Charles X. Ling, Dequan Li, Hu Zhou, ...
The problem of false positives in peptide identification via tandem mass spectrometry (MS/MS) by database searching remains unsatisfactorily resolved in the current proteomics research. The...
Learning Recursive HTN-Method Structures for planning (2008)
Qiang Yang, Rong Pan, Sinno Jialin Pan
HTN planning is one of the most effective planning methods in AI. However, designing the HTN-decomposition methods is a very difficult task which has been achieved mainly by humans. It would...
Online Co-Localization in Indoor Wireless Networks by Dimension Reduction (2008)
Jeffrey Junfeng Pan, Qiang Yang, Sinno Jialin Pan
This paper addresses the problem of recovering the locations of both mobile devices and access points from radio signals that come in a stream manner, a problem which we call online co-localization,...
Mining Web Logs for Actionable Knowledge (2008)
Qiang Yang, Charles X. Ling, Jianfeng Gao
Everyday, popular Web sites attract millions of visitors. These visitors leave behind vast amount of Web site traversal information in the form of Web server and query logs. By analyzing these logs,...
Accurate and Low-cost Location Estimation Using Kernels (2008)
Jeffery Junfeng, Pan James, T. Kwok, Qiang Yang, Yiqiang Chen
We present a novel method for indoor-location estimation using a vector-space model based on signals received from a wireless client. Our aim is to obtain an accurate mapping between the signal space...
Feature Selection in a Kernel Space (2008)
We address the problem of feature selection in a kernel space to select the most discriminative and informative features for classification and data analysis. This is a difficult problem because the...
Detect and Track Latent Factors with Online Nonnegative Matrix Factorization (2008)
Bin Cao, Dou Shen, Jian-tao Sun, Xuanhui Wang, Qiang Yang, Zheng Chen
Detecting and tracking latent factors from temporal data is an important task. Most existing algorithms for latent topic detection such as Nonnegative Matrix Factorization (NMF) have been designed...
Co-Localization from Labeled and Unlabeled Data Using Graph Laplacian (2008)
Jeffrey Junfeng Pan, Qiang Yang
This paper addresses the problem of recovering the locations of both mobile devices and access points from radio signals, a problem which we call colocalization, by exploiting both labeled and...
Preprocessing Search Spaces for Branch and Bound Search (2008)
Heuristic search procedures are useful in a large number of problems of practical importance. Such procedures operate by searching several paths in a search space at the same time, expanding some...
Shanghai Jiao-Tong University Shanghai, P.R.China (2008)
Xiaochuan Ni, Gui-rong Xue, Xiao Ling, Yong Yu, Qiang Yang
Weblogs have become a prevalent source of information for people to express themselves. In general, there are two genres of contents in weblogs. The first kind is about the webloggers’ personal...
Adaptive Localization in a Dynamic WiFi Environment Through Multi-view Learning ∗ (2008)
Sinno Jialin Pan, James T. Kwok, Qiang Yang, Jeffrey Junfeng Pan
Accurately locating users in a wireless environment is an important task for many pervasive computing and AI applications, such as activity recognition. In a WiFi environment, a mobile device can be...
Fourier Domain Algorithm for the Fitting Step in Multi-Conjugate Adaptive Optics (2008)
In this paper we present a Fourier-domain preconditioned conjugate gradient algorithm for the fitting step in Multi-Conjugate Adaptive Optics (MCAO) for extremely large telescopes. This algorithm is...
Top 10 algorithms in data mining (2008)
Wu, Xindong, Kumar, Vipin, Quinlan, J. Ross, Ghosh, Joydeep, Yang, Qiang, Motoda, Hiroshi, ...
Yes
Top 10 algorithms in data mining (2008)
Wu, Xindong, Kumar, Vipin, Quinlan, J. Ross, Ghosh, Joydeep, Yang, Qiang, Motoda, Hiroshi, ...
Can chinese web pages be classified with english data source (2008)
Xiao Ling, Gui-rong Xue, Wenyuan Dai, Yun Jiang, Qiang Yang, Yong Yu
As the World Wide Web in China grows rapidly, mining knowledge in Chinese Web pages becomes more and more important. Mining Web information usually relies on the machine learning techniques which...
Top 10 algorithms in data mining (2008)
Wu, Xindong, Kumar, Vipin, Quinlan, J. Ross, Ghosh, Joydeep, Yang, Qiang, Motoda, Hiroshi, ...
Acquisition and Maintenance of Text-based Plans (2007)
Qiang Yang, Kirsti Racine, Zhong Zhang
Text-based plans are plans whose steps and goals are described in a textual format. In contrast to logicbased plans -- plans that are represented based on variations of a first-order logic format --...
Redundancy and Inconsistency Detection in Large and Semi-structured Case Bases (2007)
With the dramatic proliferation of case based reasoning systems in commercial applications, many case bases are now becoming legacy systems. They represent a significant portion of an...
Taylor Series Prediction: A Cache Replacement Policy Based on Second-Order Trend Analysis (2007)
Qiang Yang Haining, Qiang Yang, Haining Henry Zhang, Hui Zhang
Caching is one of the most effective techniques for improving the performance of Internet systems. The heart of a caching system is its page replacement policy, which decides which page to replace in...
Activating Case-based Reasoning with Active Databases (2007)
. Many of today's CBR systems are passive in nature: they require human users to activate them manually and to provide information about the incoming problem explicitly. In this paper, we...
Maintaining Large Case Bases Using Index Learning and Clustering (2007)
Qiang Yang, Jing Wu, Zhong Zhang
In a typical case based reasoning application, the case bases grow at a very fast rate and their contents become increasingly diverse, making it necessary to partition a large case base into several...
Maintaining Large Case Bases Using Index Learning and Clustering (2007)
Qiang Yang, Jing Wu, Zhong Zhang
In a typical case based reasoning application, the case bases grow at a very fast rate and their contents become increasingly diverse, making it necessary to partition a large case base into several...
Agent Systems for Information-Gathering (2007)
Ra Hayden, Christina Carrick, Christina Carrick, Sandra Hayden, Qiang Yang, Qiang Yang, ...
Information retrieval and database technology has long been interested in the problems of retrieving relevant information from vast data and information stores. The availability of information on the...
CaseNet: A Distributed Case-based Reasoning Network (2007)
Yong Wang, Qiang Yang, Zhong Zhang
. In a network of CBR systems, each system may have different capabilities and availability for solving any particular problems. It is expected that by integrating multiple CBR systems into a...
Applying Design Patterns to State-Space Search Applications (2007)
Philip Fong, Edward Kim, Qiang Yang
ion-based planners [9] solve the more critical part of the problem, and then use the result to constrain the search of the first-principle planners. To build a heuristic problem solver, we then have...
Restoring Meaningful Episodes in a Proxy Log (2007)
Wenwu Lou, Hongjun Lu, Guimei Liu, Qiang Yang
Web logs collected at proxy servers, referred to as proxy logs, contain rich information about Web user activities. These logs are becoming critical data sources for various Web applications such as...
Building Association-Rule Based Sequential Classifiers for Web-document Prediction (2007)
Qiang Yang (contact, Qiang Yang, Tianyi Li, Tianyi Li, Ke Wang, Ke Wang
Web servers keep track of web users ’ browsing behavior in web logs. From these logs, one can build statistical models that predict the users ’ next requests based on their current behavior....
Real-Time Scheduling for Multi-Agent Call Center Automation (2007)
Yong Wang, Qiang Yang, Zhong Zhang
Abstract. In a call center, service agents with different capabilities are available for solving incoming customer problems at any time. To supply quick response and better problem solution to...
Constraint-based Program Plan Recognition in Legacy Code (2007)
It is well-known that large legacy code sources present many challenges for software engineering. As a result of different groups of people making mostly local changes to these sources, these code...
Mining Web Logs for Prediction Models in WWW Caching (2007)
Web caching and prefetching are well known strategies for improving the performance of Internet systems. When combined with web log mining, these strategies can decide to cache and prefetch web...
Mining the Customer's Up-To-Moment Preferences for E-Commerce Recommendation (2007)
Yi-Dong Shen, Qiang Yang, Zhong Zhang, Hongjun Lu
Most existing data mining approaches to e-commerce recommendation are past data model-based in the sense that they rst build a preference model from a past dataset and then apply the model to current...
Semi-supervised learning with very few labeled training examples (2007)
Zhi-hua Zhou, De-chuan Zhan, Qiang Yang
In semi-supervised learning, a number of labeled examples are usually required for training an initial weakly useful predictor which is in turn used for exploiting the unlabeled examples. However, in...
Yan Fu, Rong Pan, Wen Gao, Qiang Yang, Si-min He
In many information retrieval systems such as Web search engines and biological-sequence search engines, the ranking functions that list the search results in order of their relevances to the query...
Document Summarization using Conditional Random Fields (2007)
Dou Shen, Jian-tao Sun, Hua Li, Qiang Yang, Zheng Chen
Many methods, including supervised and unsupervised algorithms, have been developed for extractive document summarization. Most supervised methods consider the summarization task as a twoclass...
Graph embedding and extension: A general framework for dimensionality reduction (2007)
Shuicheng Yan, Dong Xu, Benyu Zhang, Hong-jiang Zhang, Qiang Yang, Senior Member, ...
Abstract—Over the past few decades, a large family of algorithms—supervised or unsupervised; stemming from statistics or geometry theory—has been designed to provide different solutions to the...
Sensor-based Abnormal Human-Activity Detection (2007)
Jie Yin, Qiang Yang, Jeffrey Junfeng Pan
With the availability of affordable sensors and sensor networks, sensor-based human activity recognition has attracted much attention in artificial intelligence and ubiquitous computing. In this...
Transferring naive bayes classifiers for text classification (2007)
Wenyuan Dai, Gui-rong Xue, Qiang Yang, Yong Yu
A basic assumption in traditional machine learning is that the training and test data distributions should be identical. This assumption may not hold in many situations in practice, but we may be...
Boosting for transfer learning (2007)
Wenyuan Dai, Qiang Yang, Gui-rong Xue, Yong Yu
Traditional machine learning makes a basic assumption: the training and test data should be under the same distribution. However, in many cases, this identicaldistribution assumption does not hold....
Document Summarization using Conditional Random Fields (2007)
Dou Shen, Jian-tao Sun, Hua Li, Qiang Yang, Zheng Chen
Many methods, including supervised and unsupervised algorithms, have been developed for extractive document summarization. Most supervised methods consider the summarization task as a twoclass...
Coordinated control for networked multi-agent systems (2007)
Zhipu Jin, Xin Liu, Changlin Pang, Zhengrong Wang, Qiang Yang, Chengzhong Zhang
iii To my parents, my brother, and my dear wife Acknowledgements iv First of all, I would like to express my heartfelt gratitude to my advisor, Prof. Richard M. Murray, for his guidance that is so...
Incorporating prior domain knowledge into a kernel based feature selection algorithm (2007)
Yu, Ting, Stokes, Donald, ...
This paper proposes a new method of incorporating prior domain knowledge into a kernel based feature selection algorithm. The proposed feature selection algorithm combines the Fast Correlation-Based...
Incorporating prior domain knowledge into a kernel based feature selection algorithm (2007)
Yu, Ting, Stokes, Donald, ...
This paper proposes a new method of incorporating prior domain knowledge into a kernel based feature selection algorithm. The proposed feature selection algorithm combines the Fast Correlation-Based...
Fourier domain preconditioned conjugate gradient algorithm for atmospheric tomography (2006)
Yang, Qiang, Vogel, Curtis R., Ellerbroek, Brent L.
By 'atmospheric tomography' we mean the estimation of a layered atmospheric turbulence profile from measurements of the pupil-plane phase (or phase gradients) corresponding to several different guide...
Test Strategies for Cost-Sensitive Decision Trees (2006)
Shengli Sheng, Charles X. Ling, Qiang Yang
Abstract. We study cost-sensitive learning of decision trees that incorporate both test costs and misclassification costs. In particular, we first propose a lazy decision tree learning that minimizes...
Xiaoyan Wang, Queen Mary, Qiang Yang, Jimmy Leung, Shaowen Lu, Bo Yu, ...
To my parents and my husband, Daxu
Gui-rong Xue, Yong Yu, Dou Shen, Qiang Yang, Hua-jun Zeng, Zheng Chen
Abstract. Existing categorization algorithms deal with homogeneous Web objects, and consider interrelated objects as additional features when taking the interrelationships with other types of objects...
Test Strategies for Cost-Sensitive Decision Trees (2006)
Charles X. Ling, Victor S. Sheng, Qiang Yang, Senior Member
Abstract—In medical diagnosis, doctors must often determine what medical tests (e.g., X-ray and blood tests) should be ordered for a patient to minimize the total cost of medical tests and...
Power-Efficient AccessPoint Selection for Indoor Location Estimation (2006)
Yiqiang Chen, Qiang Yang, Senior Member, Jie Yin, Xiaoyong Chai
Abstract—An important goal of indoor location estimation systems is to increase the estimation accuracy while reducing the power consumption. In this paper, we present a novel algorithm known as...
Test Strategies for Cost-Sensitive Decision Trees (2006)
Shengli Sheng, Charles X. Ling, Qiang Yang
Abstract. We study cost-sensitive learning of decision trees that incorporate both test costs and misclassification costs. In particular, we first propose a lazy decision tree learning that minimizes...
A Comparison of Implicit and Explicit Links for Web Page Classification (2006)
Dou Shen, Jian-Tao Sun, Qiang Yang, Zheng Chen
It is well known that Web-page classification can be enhanced by using hyperlinks that provide linkages between Web pages. However, in the Web space, hyperlinks are usually sparse, noisy and thus in...
Reinforcing Web-object Categorization through Interrelationships (2006)
Gui-Rong Xue, Yong Yu, Dou Shen, Qiang Yang, Zheng Chen
Existing categorization algorithms deal with homogeneous Web objects, and consider interrelated objects as additional features when taking the interrelationships with other types of objects into...
Jeffrey Junfeng Pan, James T. Kwok, Qiang Yang, Senior Member, Yiqiang Chen
Abstract—In this paper, we present an algorithm for multidimensional vector regression on data that are highly uncertain and nonlinear, and then apply it to the problem of indoor location...
A comparison of implicit and explicit links for web page classification (2006)
Dou Shen, Qiang Yang, Zheng Chen
Classification
A novel scalable algorithm for supervised subspace learning (2006)
Jun Yan, Ning Liu, Benyu Zhang, Qiang Yang, Shuicheng Yan, Zheng Chen
Subspace learning approaches aim to discover important statistical distribution on lower dimensions for high dimensional data. Methods such as Principal Component Analysis (PCA) do not make use of...
Test Strategies for Cost-Sensitive Decision Trees (2006)
Shengli Sheng, Charles X. Ling, Qiang Yang
Abstract. We study cost-sensitive learning of decision trees that incorporate both test costs and misclassification costs. In particular, we first propose a lazy decision tree learning that minimizes...
Query enrichment for web-query classification (2006)
Dou Shen, Rong Pan, Jian-tao Sun, Jeffrey Junfeng Pan, Kangheng Wu, Jie Yin, ...
Web search queries are typically short and ambiguous. To classify these queries into certain target categories is a difficult but important problem. In this paper, we present a new technique called...
Query enrichment for web-query classification (2006)
Dou Shen, Rong Pan, Jian-tao Sun, Jeffrey Junfeng Pan, Kangheng Wu, Jie Yin, ...
Web-search queries are typically short and ambiguous. To classify these queries into certain target categories is a difficult but important problem. In this article, we present a new technique called...
A Manifold Regularization Approach to Calibration Reduction for Sensor-Network Based Tracking (2006)
Jeffrey Junfeng Pan, Qiang Yang, Hong Chang, Dit-yan Yeung
The ability to accurately detect the location of a mobile node in a sensor network is important for many artificial intelligence (AI) tasks that range from robotics to context-aware computing. Many...
Evaluating the Trade-Offs in Partial-Order Planning Algorithms (2005)
Knoblock, Craig A., Yang, Qiang
Most practical partial-order planning systems employ some form of goal protection. However, it is not clear from previous work what the tradeoffs are between the different goal protection strategies....
Learning quantifiable associations via principal sparse non-negative matrix factorization (2005)
Chenyong Hu, Benyu Zhang, Yongji Wang, Shuicheng Yan, Zheng Chen, Qing Wang, ...
Association rules are traditionally designed to capture statistical relationship among itemsets in a given database. To additionally capture the quantitative association knowledge, Korn et.al....
An incremental subspace learning algorithm to categorize large scale text data (2005)
Jun Yan, Qiansheng Cheng, Qiang Yang, Benyu Zhang
Abstract. The dramatic growth in the number and size of on-line information sources has fueled increasing research interest in the incremental subspace learning problem. In this paper, we propose an...
Scalable collaborative filtering using cluster-based smoothing (2005)
Gui-rong Xue, Chenxi Lin, Qiang Yang, Wensi Xi, Hua-jun Zeng, Yong Yu, ...
Memory-based approaches for collaborative filtering identify the similarity between two users by comparing their ratings on a set of items. In the past, the memory-based approaches have been shown to...
Web-page summarization using clickthrough data (2005)
Jian-tao Sun, Qiang Yang, Yuchang Lu
Most previous Web-page summarization methods treat a Web page as plain text. However, such methods fail to uncover the full knowledge associated with a Web page to build a high-quality summary,...
Q2c@ust: our winning solution to query classification in kddcup 2005 (2005)
Dou Shen, Rong Pan, Jian-tao Sun, Jeffrey Junfeng Pan, Kangheng Wu, Jie Yin, ...
In this paper, we describe our ensemble-search based approach,
Efficient text classification by weighted proximal svm (2005)
Dong Zhuang, Benyu Zhang, Qiang Yang, Jun Yan, Zheng Chen, Ying Chen
In this paper, we present an algorithm that can classify large-scale text data with high classification quality and fast training speed. Our method is based on a novel extension of the proximal SVM...
Discriminant analysis with tensor representation (2005)
Shuicheng Yan, Dong Xu, Qiang Yang, Lei Zhang, Xiaoou Tang, Hong-jiang Zhang
In this paper, we present a novel approach to solving the supervised dimensionality reduction problem by encoding an image object as a general tensor of 2nd or higher order. First, we propose a...
Efficient text classification by weighted proximal svm (2005)
Dong Zhuang, Benyu Zhang, Qiang Yang, Jun Yan, Zheng Chen, Ying Chen
In this paper, we present an algorithm that can classify large-scale text data with high classification quality and fast training speed. Our method is based on a novel extension of the proximal SVM...
Learning action models from plan examples with incomplete knowledge (2005)
Qiang Yang, Kangheng Wu, Yunfei Jiang
AI planning requires the definition of an action model using a language such as PDDL as input. However, building an action model from scratch is a difficult and time-consuming task even for experts....
Activity Recognition through Goal-Based Segmentation (2005)
Jie Yin And, Jie Yin, Dou Shen, Qiang Yang
Amajor issue in activity recognition in a sensor network is how to automatically segment the low-level signal sequences in order to optimize the probabilistic recognition models for goals and...
Web-Page Summarization Using Clickthrough Data (2005)
Jian-tao Sun, Qiang Yang, Yuchang Lu
Most previous Web-page summarization methods treat a Web page as plain text. However, such methods fail to uncover the full knowledge associated with a Web page to build a high-quality summary,...
Exploiting the hierarchical structure for link analysis (2005)
Gui-rong Xue, Qiang Yang, Hua-jun Zeng, Yong Yu, Zheng Chen
Link analysis algorithms have been extensively used in Web information retrieval. However, current link analysis algorithms generally work on a flat link graph, ignoring the hierarchal structure of...
Discriminant analysis with tensor representation (2005)
Shuicheng Yan, Dong Xu, Qiang Yang, Lei Zhang, Xiaoou Tang, Hong-jiang Zhang
In this paper, we present a novel approach to solving the supervised dimensionality reduction problem by encoding an image object as a general tensor of 2nd or higher order. First, we propose a...
Exploiting the hierarchical structure for link analysis (2005)
Gui-rong Xue, Qiang Yang, Hua-jun Zeng, Yong Yu, Zheng Chen
Link analysis algorithms have been extensively used in Web information retrieval. However, current link analysis algorithms generally work on a flat link graph, ignoring the hierarchal structure of...
Li, Dequan, Fu, Yan, Sun, Ruixiang, Ling, Charles X., Wei, Yonggang, Zhou, Hu, ...
Summary: Research in proteomics requires powerful database-searching software to automatically identify protein sequences in a complex protein mixture via tandem mass spectrometry. In this paper, we...
This thesis is concerned with variational principles for general coupled thermomechanical problems in dissipative materials including finite elastic and plastic deformation, non-Newtonian viscosity,...
This thesis is concerned with variational principles for general coupled thermomechanical problems in dissipative materials including finite elastic and plastic deformation, non-Newtonian viscosity,...
The curvature adaptive optics system modeling / (2004)
Thesis (Ph. D.)--Michigan Technological University, 2004.
Case Retrieval using Nonlinear Feature-Space Transformation (2004)
Abstract. Good similarity functions are at the heart of effective case-based reasoning. However, the similarity functions that have been designed so far have been mostly linear, weighted-sum in...
A block-based support vector machine approach to the protein homology prediction task (2004)
Yan Fu, Ruixiang Sun, Qiang Yang, Simin He, Chunli Wang, Haipeng Wang, ...
This paper describes our solution for the protein homology prediction task in KDD Cup 2004 competition. This task is modeled as a supervised learning problem with multiple performance metrics....
Decision trees with minimal costs (2004)
Charles X. Ling, Qiang Yang, Jianning Wang, Shichao Zhang
We propose a simple, novel and yet effective method for building and testing decision trees that minimizes the sum of the misclassification and test costs. More specifically, we first put forward an...
Mining ratio rules via principal sparse non-negative matrix factorization (2004)
Chenyong Hu, Benyu Zhang, Shuicheng Yan, Qiang Yang, Jun Yan, Zheng Chen, ...
Association rules are traditionally designed to capture statistical relationship among itemsets in a given database. To additionally capture the quantitative association knowledge, F.Korn et al...
Test-cost sensitive naive bayes classification (2004)
Xiaoyong Chai, Lin Deng, Qiang Yang
Inductive learning techniques such as the naive Bayes and decision tree algorithms have been extended in the past to handle different types of costs mainly by distinguishing different costs of...
Case Retrieval using Nonlinear Feature-Space Transformation (2004)
Abstract. Good similarity functions are at the heart of effective case-based reasoning. However, the similarity functions that have been designed so far have been mostly linear, weighted-sum in...
IMMC: Incremental Maximum Margin Criterion (2004)
Jun Yan, Jun Yan Benyu, Shuicheng Yan, Qiang Yang, Hua Li, Zheng Chen, ...
Subspace learning approaches have attracted much attention in academia recently. However, the classical batch algorithms no longer satisfy the applications on streaming data or large-scale data. To...
Decision trees with minimal costs (2004)
Charles X. Ling, Qiang Yang, Jianning Wang, Shichao Zhang
We propose a simple, novel and yet effective method for building and testing decision trees that minimizes the sum of the misclassification and test costs. More specifically, we first put forward an...
Irc: An iterative reinforcement categorization algorithm for interrelated web objects (2004)
Gui-rong Xue, Dou Shen, Qiang Yang, Hua-jun Zeng, Zheng Chen
Most existing categorization algorithms deal with homogeneous Web data objects, and consider interrelated objects as additional features when taking the interrelationships with other types of objects...
Learning similarity measures in non-orthogonal space (2004)
Ning Liu, Benyu Zhang, Jun Yan, Qiang Yang, Shuicheng Yan, Zheng Chen, ...
Many machine learning and data mining algorithms crucially rely on the similarity metrics. The Cosine similarity, which calculates the inner product of two normalized feature vectors, is one of the...
Fu, Yan, Yang, Qiang, Sun, Ruixiang, Li, Dequan, Zeng, Rong, Ling, Charles X., ...
Motivation: The correlation among fragment ions in tandem mass spectrum is crucial in reducing stochastic mismatches for peptide identification by database searching. Up to now, an efficient scoring...
Fu, Yan, Yang, Qiang, Sun, Ruixiang, Li, Dequan, Zeng, Rong, Ling, Charles X., ...
Motivation: The correlation among fragment ions in a tandem mass spectrum is crucial in reducing stochastic mismatches for peptide identification by database searching. Until now, an efficient...
Fu, Yan, Yang, Qiang, Sun, Ruixiang, Li, Dequan, Zeng, Rong, Ling, Charles X., ...
Motivation: The correlation among fragment ions in tandem mass spectrum is crucial in reducing stochastic mismatches for peptide identification by database searching. Up to now, an efficient scoring...
Data preparation for data mining (2003)
Shichao Zhang, Chengqi Zhang, Qiang Yang
Data preparation is a fundamental stage of data analysis. While a lot of low-quality information is available in various data sources and on the Web, many organizations or companies are interested in...
Web-Log Mining for Predictive Web Caching (2003)
Qiang Yang, Haining Henry Zhang
Abstract—Caching is a well-known strategy for improving the performance of Web-based systems. The heart of a caching system is its page replacement policy, which selects the pages to be replaced in...
Postprocessing decision trees to extract actionable knowledge (2003)
Most data mining algorithms and tools stop at discovered customer models, producing distribution information on customer profiles. Such techniques, when applied to industrial problems such as...
A data cube model for prediction-based Web prefetching (2003)
Abstract. Reducing the web latency is one of the primary concerns of Internet research. Web caching and web prefetching are two effective techniques to latency reduction. A primary method for...
Mining plans for customer-class transformation (2003)
We consider the problem of mining high-utility plans from historical plan databases that can be used to transform customers from one class to other, more desirable classes. Traditional data mining...
Web-log Cleaning for Constructing Sequential Classifiers (2003)
Qiang Yang, Tianyi Ian Li, Ke Wang
With millions of Web users visiting Web servers each day, the Web log contains valuable information about users ’ browsing behavior. In this work, we construct sequential classifiers for predicting...
Postprocessing decision trees to extract actionable knowledge (2003)
Most data mining algorithms and tools stop at discovered customer models, producing distribution information on customer profiles. Such techniques, when applied to industrial problems such as...
Web-log Cleaning for Constructing Sequential Classifiers (2003)
Qiang Yang, Tianyi Ian Li, Ke Wang
With millions of web users visiting web servers each day, the web log contains valuable information about users ’ browsing behavior. In this work, we construct sequential classifiers for predicting...
A dynamic approach to characterizing termination of general logic programs (2003)
Yi-dong Shen, Jia-huai You, Li-yan Yuan, Qiang Yang
We present a new characterization of termination of general logic programs. Most existing termination analysis approaches rely on some static information about the structure of the source code of a...
Case Mining from Large Databases (2003)
Abstract. This paper presents an approach of case mining to automatically discover case bases from large datasets in order to improve both the speed and the quality of case based reasoning. Case...
Postprocessing decision trees to extract actionable knowledge (2003)
Qiang Yang, Computer Science, Hong Kong, Technologyclearwater Bay, Kowloon Hong Kong
Extensive research in data mining has been done ondiscovering distributional knowledge about the underlying data. Models such as the Bayesian models, decision trees,support vector machines and...
A Dynamic Approach to Characterizing Termination of General Logic Programs (2002)
Shen, Yi-Dong, You, Jia-Huai, Yuan, Li-Yan, Shen, Samuel S. P., Yang, Qiang
We present a new characterization of termination of general logic programs. Most existing termination analysis approaches rely on some static information about the structure of the source code of a...
An open framework for smart and personalized distance learning (2002)
Ruimin Shen, Peng Han, Fan Yang, Qiang Yang, Joshua Zhexue Huang
Abstract. Web based learning enables more students to have access to the distance-learning environment and provides students and teachers with unprecedented flexibility and convenience. However, the...
Cut-and-pick transactions for proxy log mining (2002)
Wenwu Lou, Guimei Liu, Hongjun Lu, Qiang Yang
Abstract. Web logs collected by proxy servers, referred to as proxy logs or proxy traces, contain information about Web document accesses by many users against many Web sites.This “many-to-many ”...
Objective-Oriented Utility-Based Association Mining (2002)
Yi-Dong Shen, Zhong Zhang, Qiang Yang
The necessity to develop methods for discovering association patterns used to increase business utility of an enterprise has long been recognized in data mining community. This requires modeling...
Mining Optimal Actions for Profitable CRM (2002)
Charles X. Ling, Charles Ling Tielin, Qiang Yang, Jie Cheng
Data mining has been applied to CRM (Customer Relationship Management) in many industries witha limited success. Most data mining tools can only discover customer models or profiles (such as...
Fuzzy Cognitive Agents for Personal Recommendation (2002)
Chunyan Miao, Qiang Yang, Haijing Fang, Angela Goh
There is an increasing need for various web-service, e-commerce and e-business sites to provide personalized recommendations to on-line customers. This paper proposes a new type of personalized...
Mining High-Quality cases for hypertext prediction and prefetching (2001)
Qiang Yang, Henry Haining Zhang
Abstract. Case-based reasoning aims to use past experience to solve new problems. A strong requirement for its application is that extensive experience base exists that provides statistically...
Building Association-Rule Based Sequential Classifiers for Web-Document Prediction (2001)
Qiang Yang, Tianyi Li, Ke Wang
Abstract. Web servers keep track of web users ’ browsing behavior in web logs. From these logs, one can build statistical models that predict the users ’ next requests based on their current...
ActiveCBR: An Agent System That Integrates Case-Based Reasoning and Active Database (2001)
Abstract. Case-based reasoning (CBR) is an artificial intelligence (AI) technique for problem solving that uses previous similar examples to solve a current problem. Despite its success, most current...
Abstract. In interactive case-based reasoning, it is important to present a small number of important cases and problem features to the user at one time. This goal is difficult to achieve when large...
Correlation-based Document Clustering using Web Logs (2001)
Zhong Su, Qiang Yang, Hongjiang Zhang
A problem facing information retrieval on the web is how to effectively cluster large amounts of web documents. One approach is to cluster the documents based on information provided only by users...
A case-addition policy for case-base maintenance (2001)
A major problem in many practical applications of case-based reasoning (CBR) and knowledge reuse is how to keep the case bases concise and complete. To solve this problem requires repeated...
Feature Weight Maintenance in Case Bases Using Introspective Learning (2001)
Abstract. A key issue in case-based reasoning is how to maintain the domain knowledge in the face of a changing environment. During the case retrieval process in case-based reasoning, feature-value...
Correlation-based Document Clustering using Web Logs (2001)
Zhong Su, Qiang Yang, Hongjiang Zhang
A problem facing information retrieval on the web is how to effectively cluster large amounts of web documents. One approach is to cluster the documents based on information provided only by users...
Correlation-based Document Clustering using Web Logs (2001)
Zhong Su, Qiang Yang, Hongjiang Zhang
A problem facing information retrieval on the web is how to effectively cluster large amounts of web documents. One approach is to cluster the documents based on information provided only by users...
Correlation-based Document Clustering using Web Logs (2001)
Zhong Su, Qiang Yang, Hongjiang Zhang
A problem facing information retrieval on the web is how to effectively cluster large amounts of web documents. One approach is to cluster the documents based on information provided only by users...
Qiang Yang, Hai-feng Wang, Ji-rong Wen, Gao Zhang, Ye Lu, Hong-jiang Zhang
Abstract. As more information becomes available on the World Wide Web, it has become an acute problem to provide effective search tools for information access. Previous generations of search engines...
Ye Lu, Chunhui Hu, Xingquan Zhu, Hongjiang Zhang, Qiang Yang
The relevance feedback approach to image retrieval is a powerful technique and has been an active research direction for the past few years. Various ad hoe parameter estimation techniques have been...
Keep it Simple: A Case-Base Maintenance Policy Based on Clustering and Information Theory (2000)
Abstract. Today’s case based reasoning applications face several challenges. In a typical application, the case bases grow at a very fast rate and their contents become increasingly diverse, making...
Keep It Simple: A Case-base Maintenance Policy Based on Clustering and Information Theory (2000)
. Today's case based reasoning applications face several challenges. In a typical application, the case bases grow at a very fast rate and their contents become increasingly diverse, making it...
WhatNext: A Prediction System for Web Requests using N-gram Sequence Models (2000)
Zhong Su, Qiang Yang, Ye Lu, Hong-Jiang Zhang, Va S Canada
As an increasing number of users access information on the web, there is a great opportunity to learn from the server logs to learn about the users' probable actions in the future. In this...
Ye Lu, Chunhui Hu, Xingquan Zhu, Hongjiang Zhang, Qiang Yang
The relevance feedback approach to image retrieval is a powerful technique and has been an active research direction for the past few years. Various ad hoc parameter estimation techniques have been...
A prediction system for multimedia pre-fetching in Internet (2000)
The rapid development of Internet has resulted in more and more multimedia in Web content. However, due to the limitation in the bandwidth and huge size of the multimedia data, users always suffer...
Towards A Next-Generation Search Engine (2000)
Qiang Yang, Hai-Feng Wang, Ji-rong Wen, Gao Zhang, Ye Lu, Kai-Fu Lee, ...
. As more information becomes available on the World Wide Web, it has become an acute problem to provide effective search tools for information access. Previous generations of search engines are...
Ye Lu, Chunhui Hu, Xingquan Zhu, Hongjiang Zhang, Qiang Yang
The relevance feedback approach to image retrieval is a powerful technique and has been an active research direction for the past few years. Various ad hoc parameter estimation techniques have been...
Activating CBR systems through autonomous information gathering (1999)
Christina Carrick, Qiang Yang, Irene Abi-zeid, Luc Lamontagne
Abstract. Most traditional CBR systems are passive in nature, adopting an advisor role in which a user manually consults the system. In this paper, we propose a system architecture and algorithm for...
Is CBR applicable to the coordination of search and rescue operations? A feasibility study (1999)
Irène Abi-zeid, Qiang Yang, Luc Lamontagne
Abstract. In response to the occurrence of an air incident, controllers at one of the three Canadian Rescue Coordination Centers (RCC) must make a series of critical decisions on the appropriate...
Plan Mining by Divide-and-Conquer (1999)
Jiawei Han, Qiang Yang, Edward Kim
Plans or sequences of actions are an important form of data. With the proliferation of database technology, plan databases (or planbases) are increasingly common. Efficient discovery of important...
Is CBR applicable to the Coordination of Search and Rescue Operations? A feasibility study (1999)
. In response to the occurrence of an air incident, controllers at one of the three Canadian Rescue Coordination Centers (RCC) must make a series of critical decisions on the appropriate procedures...
Plan Mining by Divide-and-Conquer (1999)
Jiawei Han, Qiang Yang, Edward Kim
Plans or sequences of actions are an important form of data. With the proliferation of database technology, plan databases (or planbases) are increasingly common. Efficient discovery of important...
Architectural Design Patterns for Multiagent Coordination (1999)
Sandra Hayden, Ra C. Hayden, Christina Carrick, Qiang Yang
This paper presents our first step towards agent-oriented software engineering, focusing on the area of coordinated multi-agent systems. In multi-agent systems, the interactions between the agents...
Plan Mining by Divide-and-Conquer (1999)
Jiawei Han Qiang, Qiang Yang, Edward Kim
Plans or sequences of actions are an important form of data. With the proliferation of database technology, plan databases (or planbases) are increasingly common. Efficient discovery of important...
Plan Mining by Divide-and-Conquer (1999)
Jiawei Han Qiang, Qiang Yang, Edward Kim
Plans or sequences of actions are an important form of data. With the proliferation of database technology, plan databases (or planbases) are increasingly common. Efficient discovery of important...
Activating CBR Systems through Autonomous Information Gathering (1999)
Christina Carrick, Qiang Yang, Irene Abi-zeid, Luc Lamontagne
. Most traditional CBR systems are passive in nature, adopting an advisor role in which a user manually consults the system. In this paper, we propose a system architecture and algorithm for...
Automatically Selecting and Using Primary Effects in Planning: Theory and Experiments, (1998)
Using primary effects of operators in planning is an effective approach to reducing planning time and improving solution quality. However, the characterization of 'good' primary effects has remained...
Applying plan recognition algorithms to program understanding (1998)
Alex Quilici, Qiang Yang, Steven Woods
Abstract. Program understanding is often viewed as the task of extracting plans and design goals from program source. As such, it is natural to try to apply standard AI plan recognition techniques to...
Towards lifetime maintenance of case based indexes for continual case based reasoning (1998)
Abstract. One of the key areas of case based reasoning is how to main-tain the domain knowledge in the face of a changing environment. During case retrieval, a key process of CBR, feature-value pairs...
Applying plan recognition algorithms to program understanding (1998)
Alex Quilici, Qiang Yang, Steven Woods
Program understanding is often viewed as the task of extracting plans and design goals from program source. As such, it is natural to try to apply standard AI plan recognition techniques to the...
Towards Lifetime Maintenance of Case Base Indexes for Continual Case Based Reasoning (1998)
One of the key areas of case based reasoning is how to maintain the domain knowledge in the face of a changing environment. During case retrieval process, a key process of CBR, feature-value pairs...
A Lazy Model-Based Approach to On-Line Classification (1998)
Gabor Melli, Name Gabor Melli, Senior Supervisor, Dr. Qiang Yang
The growing access to large amounts of structured observations allows for more opportunistic uses of this data. An example of this, is the prediction of an event's class membership based on a...
Design Patterns for Planning Systems (1998)
In this work, we are interested in building a software engineering discipline for planning system design. Our objective is to enable planning systems to become more configurable and modular, with the...
Remembering to Add: Competence-preserving Case-Addition Policies for Case-Base Maintenance (1998)
Case-base maintenance is gaining increasing recognition in research and the practical applications of case-based reasoning (CBR). This intense interest is highlighted by Smyth and Keane's...
An Agent System for Intelligent Situation Assessment (1998)
Coordinating Search and Rescue (SAR) operations is a knowledge and information intensive task. Upon receiving an initial indication about a possible aircraft related problem, a Rescue Coordination...
An agent system for intelligent situation assessment (1998)
Qiang Yang, Irene Abi-zeid, Luc Lamontagne
luc.|amontagne @ drev.dnd.cs Abstract Coordinating Search and Rescue (SAR) operations is a knowledge and information intensive task. Upon receiving an initial indication about a possible aircraft...
Maintaining unstructured case bases (1997)
Abstract. With the dramatic proliferation of case based reasoning systems in commercial applications, many case bases are now becoming legacy systems. They represent a signi cant portion of an...
Maintaining Unstructured Case Bases (1997)
. With the dramatic proliferation of case based reasoning systems in commercial applications, many case bases are now becoming legacy systems. They represent a significant portion of an...
Applying Plan Recognition Algorithms To Program Understanding (1997)
Alex Quilici, Qiang Yang, Steven Woods
. Program understanding is often viewed as the task of extracting plans and design goals from program source. As such, it is natural to try to apply standard AI plan recognition techniques to the...
Applying Plan Recognition Algorithms to Program Understanding (1997)
Alex Quilici, Qiang Yang, Steven Woods
Program understanding is often viewed as the task of extracting plans and design goals from program source. As such, it is natural to try to apply standard AI plan recognition techniques to the...
Qiang Yang, Edward Kim, Kirsti Racine
We present CASEADVISOR system for supporting help desk applications. CASEADVISOR improves existing case based reasoning systems on several fronts. Its decision forests help compress a large case base...
Applying Plan Recognition Algorithms to Program Understanding (1997)
Alex Quilici, Qiang Yang, Steven Woods
Program understanding is often viewed as the task of extracting plans and design goals from program source. As such, it is natural to try to apply standard AI plan recognition techniques to the...
Design and Implementation of On-Line Analytical Processing (OLAP) of Spatial Data (1997)
Nebojsa Stefanovic, Name Nebojsa Stefanovi'c, Senior Supervisor, Dr. Qiang Yang
On-line analytical processing (OLAP) has gained its popularity in database industry. With a huge amount of data stored in spatial databases and the introduction of spatial components to many...
Qiang Yang, Edward Kim, Kirsti Racine
We present CASEADVISORsystem for supporting help desk applications. CASEADVISORimproves existing case based reasoning systems on several fronts. Its decision forests help compress a large case base...
The Program Understanding Problem: Analysis and A Heuristic Approach (1996)
Program understanding is the process of making sense of a complex source code. This process has been considered as computationally difficult and conceptually complex. So far, no formal complexity...
On the Consistency Management of Large Case Bases: the Case for Validation (1996)
Case-based reasoning (CBR) is a practical, relatively new technology. CBR is based on the idea that new problems can often be solved by using past solutions. The basic method used to implement CBR is...
Damage tolerance of filled glass/epoxy laminates. (1995)
Thesis (Ph. D.)--Kingston University, 1995.
Program understanding as constraint satisfaction (1995)
Abstract. The process of understanding a source code in a high-level programming language involves complex computation. Given a piece of legacy code and a library of program plan templates,...
Subbarao Kambhampati, Craig A. Knoblock, Qiang Yang
Despite the long history of classical planning, there has been very little comparative analysis of the performance tradeoffs offered by the multitude of existing planning algorithms. This is partly...
Subbarao Kambhampati, Craig A. Knoblock, Qiang Yang
Despite the long history of classical planning, there has been very little comparative analysis of the performance tradeoffs offered by the multitude of existing planning algorithms. This is partly...
Relating the Performance of Partial-Order Planning Algorithms to Domain Features (1995)
The AI planning field has a long history of introducing yet another search algorithm that is believed to be the best in all domains. Some recent examples are nonlin, tweak and snlp. In this paper we...
Relating the Performance of Partial-order planning algorithms to domain features (1995)
The AI planning eld has a long history of introducing yet another search algorithm that is believed to be the best in all domains. Some recent examples are nonlin, tweak and snlp. In this paper we...
Program Understanding as Constraint Satisfaction: Representation and Reasoning Techniques (1995)
The process of understanding a source code in a high-level programming language involves complex computation. Given a piece of legacy code and a library of program plan templates, understanding the...
Program Understanding as Constraint Satisfaction: Representation and Reasoning Techniques (1995)
The process of understanding a source code in a high-level programming language involves complex computation. Given a piece of legacy code and a library of program plan templates, understanding the...
Constraint-based Program Plan Recognition in Legacy Code (1995)
Steven Woods And, Steven G. Woods, Qiang Yang
Introduction It is well-known that large legacy code sources present many challenges for software engineering. As a result of different groups of people making mostly local changes to these sources,...
Planning with Primary Effects: Experiments and Analysis (1995)
The use of primary effects in planning is an effective approach to reducing search. The underlying idea of this approach is to select certain "important" effects among the effects of each...
Steven Woods, Alex Quilici, Qiang Yang
Different program understanding algorithms often use different representational frameworks and take advantage of numerous heuristic tricks. This situation makes it is difficult to compare these...
Program Understanding as Constraint Satisfaction: Representation and Reasoning Techniques (1995)
The process of understanding a source code in a high-level programming language involves complex computation. Given a piece of legacy code and a library of program plan templates, understanding the...
Planning with primary effects: Experiments and analysis (1995)
The use of primary effects in planning is an efTecti\e approach to reducing search The underlying idea of this approach is to select certain "important " effects among the effects...
Planning with primary effects: Experiments and analysis (1995)
The use of primary effects in planning is an effective approach to reducing search. The underlying idea of this approach is to select certain “important ” effects among the effects of each...
Delaying variable binding commitments in planning (1994)
One of the problems with many partial-order planners is their eager commitment to variable bindings. This is contrary to their control decision in delayedcommitment of operator orderings. In this...
Evaluating the tradeoffs in partial-order planning algorithms (1994)
Most practical partial-order planning systems employ some form of goal protection. However, it is not clear from previous work what the tradeoffs are between the different goal-protection strategies....
An Evaluation of the Temporal Coherence Heuristic in Partial-Order Planning (1994)
This paper presents an evaluation of a heuristic for partial-order planning, known as temporal coherence. The temporal coherence heuristic was proposed by Drummond and Currie as a method to improve...
On the Implementation and Evaluation of ABTWEAK (1994)
Qiang Yang, Josh D. Tenenberg, Steven Woods
In this paper we describe the implementation and evaluation of the AbTweak planning system, a test bed for studying and teaching concepts in partial-order planning, abstraction, and search control....
Evaluating the Tradeoffs in Partial-Order Planning Algorithms (1994)
Most practical partial-order planning systems employ some form of goal protection. However, it is not clear from previous work what the tradeoffs are between the different goalprotection strategies....
Automatically Selecting and Using Primary Effects in Planning: Theory and Experiments (1994)
The use of primary effects of operators is an effective approach to improving the efficiency of planning. The characterization of "good" primary effects, however, has remained at an...
Delaying Variable Binding Commitments in Planning (1994)
One of the problems with many partial-order planners is their eager commitment to variable bindings. This is contrary to their control decision in delayedcommitment of operator orderings. In this...
Automatically Selecting and Using Primary Effects in Planning: Theory and Experiments (1994)
Using primary effects of operators in planning is an effective approach to reducing planning time and improving solution quality. However, the characterization of "good" primary effects has...
Automatically Selecting and Using Primary Effects in Planning: Theory and Experiments (1994)
The use of primary effects of operators is an effective approach to improving the efficiency of planning. The characterization of "good" primary effects, however, has remained at an...
Search Reduction in Planning with Primary Effects (1994)
The use of primary effects in planning is an effective approach for reducing search costs, closely related to abstraction planning. However, there has been little analysis of planning with primary...
Automatically Selecting and Using Primary Effects in Planning: Theory and Experiments (1994)
The use of primary e#ects of operators is an e#ective approach to improving the e#ciency of planning. The characterization of "good" primary e#ects, however, has remained at an informal...
Automatically selecting and using primary effects in planning: Theory and experiments (1994)
The use of primary effects of operators is an effective approach to improving the efficiency of planning. The characterization of “good ” primary effects, however, has remained at an informal...
Automatically selecting and using primary effects in planning: Theory and experiments (1994)
The use of primary effects of operators is an effective approach to improving the efficiency of planning. The characterization of “good ” primary effects, however, has remained at an informal...
Downward refinement and the efficiency of hierarchical problem solving (1994)
Analysis and experiments have shown that hierarchical problem-solving is most effective when the hierarchy satisfies the downward refinement property (DRP), whereby every abstract solution can be...
An evaluation of the temporal coherence heuristic in partial-order planning (1994)
This paper presents an evaluation of a heuristic for partial-order planning, known as temporal coherence. The temporal coherence heuristic was proposed by Drummond and Currie as a method to improve...
Search reduction in planning with primary effects (1994)
The use of primary effects in planning is an effective approach for reducing search costs, closely related to abstraction planning. However, there has been little analysis of planning with primary...
Downward Refinement and the Efficiency of Hierarchical Problem Solving (1993)
Analysis and experiments have shown that hierarchical problem-solving is most effective when the hierarchy satisfies the downward refinement property (DRP), whereby every abstract solution can be...
Forbidding Preconditions and Ordered Abstraction Hierarchies (1993)
ion Hierarchies Eugene Fink School of Computer Science Carnegie Mellon University Pittsbugrh, PA 15213 eugene@cs.cmu.edu Qiang Yang Department of Computer Science University of Waterloo Waterloo,...
Characterizing and Automatically Finding Primary Effects in Planning (1993)
The use of primary effects of operators in planning is an effective approach to reduce search costs. However, the characterization of "good" primary effects has remained at an informal...
Characterizing and Automatically Finding Primary Effects in Planning (1993)
The use of primary e#ects of operators in planning is an e#ective approach to reduce search costs. However, the characterization of "good" primary e#ects has remained at an informal level....
Characterizing and automatically finding primary effects in planning (1993)
The use of primary effects of operators in planning is an effective approach to reduce search costs. However, the characterization of “good” primary effects has remained at an informal level. In...
Theory and Algorithms for Plan Merging (1992)
David E. Foulser, Ming Li, Qiang Yang
Merging operators in a plan can yield significant savings in the cost to execute a plan. This paper provides a formal theory for plan merging and presents both optimal and efficient heuristic...
A Theory of Conflict Resolution in Planning (1992)
Conflict resolution in planning is the process of constraining a plan to remove harmful interactions that threaten its correctness. It has been a major contributing factor to the complexity of...
Merging Separately Generated Plans with Restricted Interactions (1992)
Qiang Yang, Dana S. Nau, James Hendler
Generating action sequences to achieve a set of goals is a computationally difficult task. When multiple goals are present, the problem is even worse. Although many solutions to this problem have...
A Spectrum of Plan Justifications (1992)
This paper formalizes the notion of justified plans, which captures the intuition behind "good" plans. A plan is called justified if it does not contain operators that are not necessary for...
Formalizing Plan Justifications (1992)
This paper formalizes the notion of justified plans , which captures the intuition behind "good" plans. A justified plan is one that does not contain operators which are not necessary for...
Merging Separately Generated Plans with Restricted Interactions (1992)
Qiang Yang, Dana S. Nau, James Hendler
Generating action sequences to achieve a set of goals is a computationally difficult task. When multiple goals are present, the problem is even worse. Although many solutions to this problem have...
The Expected Value of Hierarchical Problem-Solving (1992)
In the best case using an abstraction hierarchy in problem-solving can yield an exponential speed-up in search efficiency. Such a speed-up is predicted by various analytical models developed in the...
Automatically Abstracting the Effects of Operators (1992)
ing the Effects of Operators Eugene Fink Department of Computer Science University of Waterloo Waterloo, Ontario, Canada N2L3G1 efink@violet.waterloo.edu Qiang Yang Department of Computer Science...
Automatically Abstracting the Effects of Operators (1992)
The use of abstraction in problem solving is an e#ective approach to reducing search, but finding good abstractions is a di#cult problem.
A Spectrum of Plan Justifications (1992)
This paper formalizes the notion of justified plans , which captures the intuition behind "good" plans. A plan is called justified if it does not contain operators that are not necessary...
Solving partial constraint satisfaction problems using local search and abstraction (1992)
Partial constraint satisfaction problems (PCSPs) were proposed by Freuder and Wallace to address some of the representational di culties with traditional constraint satisfaction techniques. However,...
Abstraction in nonlinear planning (1991)
We extend the hierarchical, precondition-elimination abstraction of Abstrips to nonlinear, least-commitment planners such as Tweak. Speci cally, we show that the combined planning system, AbTweak,...
Abstraction in Nonlinear Planning (1991)
Qiang Yang, Josh D. Tenenberg, Steven Woods
ion in Nonlinear Planning Qiang Yang University of Waterloo Canada Josh D. Tenenberg y Indiana University at South Bend USA Steven Woods z Defense Research Establishment Valcartier Canada Abstract...
ABTWEAK: Abstracting a nonlinear, least commitment planner (1990)
We present the system AbTweak, which extends the precondition-elimination abstraction of Abstrips to hierarchical planners using the nonlinear plan representation as de ned in Tweak. We show that...
Improving the efficiency of planning /--by Qiang Yang. (1989)
Thesis (Ph. D.)--University of Maryland at College Park, 1989.
Experimental tests of a homology model for OxlT, the oxalate transporter of Oxalobacter formigenes
Yang, Qiang, Wang, Xicheng, Ye, Liwen, Mentrikoski, Mark, Mohammadi, Elham, Kim, Young-Mog, ...
Using the x-ray structure of the glycerol 3-phosphate transporter (GlpT), we devised a model for the distantly related oxalate transporter, OxlT. The model accommodates all earlier biochemical...
Liu, Ren-shui, Wei, Guo-qing, Yang, Qiang, He, Wen-jun, Liu, Wang-Yi
Cinnamomin is a novel type II ribosome-inactivating protein (RIP) isolated in our laboratory from the seed of the camphor tree (Cinnamomum camphora). In this paper the physiological role it plays in...
Experimental tests of a homology model for OxlT, the oxalate transporter of Oxalobacter formigenes
Yang, Qiang, Wang, Xicheng, Ye, Liwen, Mentrikoski, Mark, Mohammadi, Elham, Kim, Young-Mog, ...
Using the x-ray structure of the glycerol 3-phosphate transporter (GlpT), we devised a model for the distantly related oxalate transporter, OxlT. The model accommodates all earlier biochemical...
Liu, Ren-shui, Wei, Guo-qing, Yang, Qiang, He, Wen-jun, Liu, Wang-Yi
Cinnamomin is a novel type II ribosome-inactivating protein (RIP) isolated in our laboratory from the seed of the camphor tree (Cinnamomum camphora). In this paper the physiological role it plays in...
10 CHALLENGING PROBLEMS IN DATA MINING RESEARCH
In October 2005, we took an initiative to identify 10 challenging problems in data mining research, by consulting some of the most active researchers in data mining and machine learning for their...
Semi-supervised protein subcellular localization
Xu, Qian, Hu, Derek Hao, Xue, Hong, Yu, Weichuan, Yang, Qiang
The Program Understanding Problem: Analysis and A Heuristic Approach
Program understanding is the process of making sense of a complex source code. This process has been considered as computationally difficult and conceptually complex. So far, no formal complexity...
The Program Understanding Problem: Analysis and A Heuristic Approach
Program understanding is the process of making sense of a complex source code. This process has been considered as computationally difficult and conceptually complex. So far, no formal complexity...