Bmc Bioinformatics, Tao Han, Jianyong Wang, Weida Tong, Martha M Moore, James C Fuscoe, ...
Proceedings Microarray analysis distinguishes differential gene expression patterns from large and small colony Thymidine kinase mutants of L5178Y mouse lymphoma cells
Proc. VLDB 02 Multi-Dimensional Regression Analysis of Time-Series Data Streams\Lambda (2009)
Yixin Chen, Guozhu Dong, Jiawei Han, Benjamin W. Wah, Jianyong Wang
Abstract Real-time production systems and other dynamic environments often generate tremendous (potentially infinite) amount of stream data; the volume of data is too huge to be stored on disks or...
An Effective and Versatile Keyword Search Engine on Heterogenous Data Sources (2009)
Guoliang Li, Jianhua Feng, Jianyong Wang, Lizhu Zhou
We present EASE, an effective and versatile keyword search engine that enables users to easily access the heterogenous data composed of unstructured, semi-structured and structured data, without the...
Model Video Semantics with Constraints Considering Temporal Structure and Typed Events* (2009)
Yu Wang, Lizhu Zhou, Jianyong Wang
The advances of video technology and video-related applications demand appropriate video semantic models for representing video data and their semantics, and supporting powerful semantic queries on...
The Mouse Lymphoma Assay Detects Recombination, Deletion, and Aneuploidy (2009)
Wang, Jianyong, Sawyer, Jeffrey R., Chen, Ling, Chen, Tao, Honma, Masamitsu, Mei, Nan, ...
The mouse lymphoma assay (MLA) uses the thymidine kinase (Tk) gene of the L5178Y/Tk+/−-3.7.2C mouse lymphoma cell line as a reporter gene to evaluate the mutagenicity of chemical and physical...
Regression cubes with lossless compression and aggregation (2008)
Yixin Chen, Guozhu Dong, Senior Member, Jiawei Han, Senior Member, Benjamin W. Wah, ...
Abstract—As OLAP engines are widely used to support multidimensional data analysis, it is desirable to support in data cubes advanced statistical measures, such as regression and filtering, in...
Krishna Gade, Jianyong Wang, George Karypis
Various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemset-based constraints that better capture...
Edit Distance Evaluation on Graph Structures (2008)
ZENG, Zhiping, TUNG, Anthony K.H., WANG, Jianyong, FENG, Jianhua, ZHOU, Lizhu
Graph data has became ubiquitous and manipulating them based on similarity is essential for many applications. Graph edit distance is one of the most widely accepted measure to determine similarities...
Edit Distance Evaluation on Graph Structures (2008)
ZENG, Zhiping, TUNG, Anthony K.H., WANG, Jianyong, ZHOU, Lizhu
Graph data has became ubiquitous and manipulating them based on similarity is essential for many applications. Graph edit distance is one of the most widely accepted measure to determine similarities...
Jianyong Wang, George Karypis, J. Wang, G. Karypis (b
Abstract Frequent itemset mining was initially proposed and has been studied extensively in the context of association rule mining. In recent years, several studies have also extended its application...
Closed Constrained Gradient Mining in Retail Databases (2008)
Jianyong Wang, Jiawei Han, Senior Member, Jian Pei
Abstract—Incorporating constraints into frequent itemset mining not only improves data mining efficiency, but also leads to concise and meaningful results. In this paper, a framework for closed...
Guoliang Li, Jianhua Feng, Jianyong Wang, Lizhu Zhou
In this paper, we study the problem of effective keyword search over XML documents. We begin by introducing the notion of Valuable Lowest Common Ancestor (VLCA) to accurately and effectively answer...
Frequent Closed Sequence Mining without Candidate Maintenance (2008)
Jianyong Wang, Senior Member, Jiawei Han, Senior Member, Chun Li
Abstract—Previous studies have presented convincing arguments that a frequent pattern mining algorithm should not mine all frequent patterns but only the closed ones because the latter leads to not...
Regression cubes with lossless compression and aggregation (2008)
Yixin Chen, Guozhu Dong, Senior Member, Jiawei Han, Senior Member, Benjamin W. Wah, ...
Abstract—As OLAP engines are widely used to support multidimensional data analysis, it is desirable to support in data cubes advanced statistical measures, such as regression and filtering, in...
Framework For Clustering, Charu C. Aggarwal, Jiawei Han, Jianyong Wang, Philip S. Yu, Charu C. Aggarwal, ...
The clustering problem is a di#cult problem for the data stream domain. This is because the large volumes of data arriving in a stream renders most traditional algorithms too inefficient.
Cooperative Cache Management in S2FS (2007)
Jianyong Wang Mingfa, Jianyong Wang, Mingfa Zhu, Zhiwei Xu
S2FS, a descendant of NCIC's COSMOS file system prototype, is a single-image cluster file system, and good scalability is its main design goal. Reducing client-server communication and the...
A dynamically reconfigurable model for a distributed Web crawling system (2007)
Hongfei Yan, Jianyong Wang, Xiaoming Li
A web crawling system using a distributed architecture needs to coordinate the whole system when the nodes in the system change. This paper presents an efficiently dynamic reconfigurability model...
BIDE: Efficient Mining of Frequent Closed Sequences (2007)
Previous studies have presented convincing arguments that a frequent pattern mining algorithm should not mine all frequent patterns but only the closed ones because the latter leads to not only more...
ABSTRACT On Demand Classification of Data Streams (2007)
Charu C. Aggarwal, Jiawei Han, Jianyong Wang, Philip S. Yu
Current models of the classification problem do not effectively handle bursts of particular classes coming in at different times. In fact, the current model of the classification problem simply...
Han, Tao, Wang, Jianyong, Tong, Weida, Moore, Martha M, Fuscoe, James C, Chen, Tao
Abstract Background The Thymidine kinase ( Tk ) mutants generated from the widely used L5178Y mouse lymphoma assay fall into two categories, small colony and large colony. Cells from the large...
Thesis (Ph.D.)--University of Arkansas for Medical Sciences, 2006.
Coherent closed quasi-clique discovery from large dense graph databases (2006)
Zhiping Zeng, Jianyong Wang, Lizhu Zhou, George Karypis
Frequent coherent subgraphscan provide valuable knowledge about the underlying internal structure of a graph database, and mining frequently occurring coherent subgraphs from large dense graph...
Discovering frequent closed partial orders from strings (2006)
Jian Pei, Haixun Wang, Ieee Computer Society, Jian Liu, Ke Wang, Jianyong Wang, ...
Abstract—Mining knowledge about ordering from sequence data is an important problem with many applications, such as bioinformatics, Web mining, network management, and intrusion detection. For...
Wang, Jianyong, Wang, Tianzhi, Zuiderweg, Erik R. P., Crippen, Gordon M.
Rapid analysis of protein structure, interaction, and dynamics requires fast and automated assignments of 3D protein backbone triple-resonance NMR spectra. We introduce a new depth-first ordered tree...
HARMONY: Efficiently mining the best rules for classification (2005)
Many studies have shown that rule-based classification algorithms perform well in classifying categorical and sparse high-dimensional databases. However, a fundamental limitation with many rule-based...
TFP: An Efficient Algorithm for Mining Top-K Frequent Closed Itemsets (2005)
Jianyong Wang, Jiawei Han, Senior Member, Ying Lu, Petre Tzvetkov
Abstract—Frequent itemset mining has been studied extensively in literature. Most previous studies require the specification of a min_support threshold and aim at mining a complete set of frequent...
Statistical mechanics of protein folding with separable energy functions (2004)
Wang, Jianyong, Crippen, Gordon M.
We have initiated an entirely new approach to statistical mechanical models of strongly interacting systems where the configurational parameters and the potential energy function are both constructed...
Efficient closed pattern mining in the presence of tough block constraints (2004)
Krishna Gade, Jianyong Wang, George Karypis
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbased constraints that...
Previous study has shown that mining frequent patterns with length-decreasing support constraint is very helpful in removing some uninteresting patterns based on the observation that short patterns...
Efficient closed pattern mining in the presence of tough block constraints (2004)
Krishna Gade, Krishna Gade, Jianyong Wang, Jianyong Wang, George Karypis, George Karypis
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbased constraints that...
Mining sequential patterns by pattern-growth: The PrefixSpan approach (2004)
Jian Pei, Ieee Computer Society, Jiawei Han, Senior Member, Behzad Mortazavi-asl, Jianyong Wang, ...
Abstract—Sequential pattern mining is an important data mining problem with broad applications. However, it is also a difficult problem since the mining may have to generate or examine a...
A framework for projected clustering of high dimensional data streams (2004)
Charu C. Aggarwal, Jiawei Han, Jianyong Wang, Philip S. Yu, T. J. Watson, T. J. Watson, ...
The data stream problem has been studied extensively in recent years, because of the great ease in collection of stream data. The nature of stream data makes it essential to use algorithms which...
Mining sequential patterns by pattern-growth: The PrefixSpan approach (2004)
Jian Pei, Jiawei Han, Senior Member, Behzad Mortazavi-asl, Jianyong Wang, Helen Pinto, ...
Abstract—Sequential pattern mining is an important data mining problem with broad applications. However, it is also a difficult problem since the mining may have to generate or examine a...
Efficient Closed Pattern Mining in the Presence of Tough Block Constraints (2004)
Krishna Gade, Jianyong Wang, George Karypis
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbased constraints that...
A Framework for Projected Clustering of High Dimensional Data Streams (2004)
Charu C. Aggarwal, Jiawei Han, Jianyong Wang, Philip S. Yu, T. J. Watson, T. J. Watson, ...
The data stream problem has been studied extensively in recent years, because of the great ease in collection of stream data. The nature of stream data makes it essential to use algorithms which...
Clark, L.Scott, Harrington-Brock, Karen, Wang, Jianyong, Sargent, Linda, Lowry, David, Reynolds, Steve H., ...
The mouse lymphoma L5178Y Tk+/– 3.7.2C assay is a well‐characterized in vitro system used for the study of somatic cell mutation. It was determined that this cell line has a heterozygous...
Wang, Jianyong, Liu, Xiaoli, Heflich, Robert H., Chen, Tao
The time between treatment and the appearance of mutants (mutant manifestation time) is a critical variable for in vivo transgenic mutation assays. There are, however, limited data describing the...
A framework for clustering evolving data streams (2003)
Charu C. Aggarwal, T. J. Watson, Resch Ctr, Jiawei Han, Jianyong Wang, Philip S. Yu
The clustering problem is a difficult problem for the data stream domain. This is because the large volumes of data arriving in a stream renders most traditional algorithms too inefficient. In recent...
Closet+: searching for the best strategies for mining frequent closed itemsets (2003)
Mining frequent closed itemsets provides complete and nonredundant results for frequent pattern analysis. Extensive studies have proposed various strategies for efficient frequent closed itemset...
Closet+: searching for the best strategies for mining frequent closed itemsets (2003)
Mining frequent closed itemsets provides complete and nonredundant results for frequent pattern analysis. Extensive studies have proposed various strategies for efficient frequent closed itemset...
A framework for clustering evolving data streams (2003)
Charu C. Aggarwal, T. J. Watson, Resch Ctr, Jiawei Han, Jianyong Wang, Philip S. Yu
The clustering problem is a difficult problem for the data stream domain. This is because the large volumes of data arriving in a stream renders most traditional algorithms too inefficient. In recent...
Mining top-k frequent closed patterns without minimum support (2002)
Jiawei Han, Jianyong Wang, Ying Lu, Petre Tzvetkov
Support ∗
Online analytical processing stream data: Is it feasible (2002)
Yixin Chen, Guozhu Dong, Jiawei Han, Jian Pei, Benjamin W. Wah, Jianyong Wang
Multi-dimensional regression analysis of time-series data streams (2002)
Yixin Chen, Guozhu Dong, Jiawei Han, Benjamin W. Wah, Jianyong Wang
Real-time production systems and other dynamic environments often generate tremendous (potentially innite) amount of stream data; the volume of data is too huge to be stored on disks or scanned...
Online analytical processing stream data: Is it feasible (2002)
Yixin Chen, Guozhu Dong, Jiawei Han, Jian Pei, Benjamin W. Wah, Jianyong Wang
Architectural design and evaluation of an efficient Web-crawling system (2001)
Hongfei Yan, Jianyong Wang, Xiaoming Li, Lin Guo
This paper presents an architectural design and evaluation result of an efficient Web-crawling system. The design involves a fully distributed architecture, a URL allocating algorithm, and a method...
Abstract Architectural design and evaluation of an efficient Web-crawling system (2001)
Hongfei Yan, Jianyong Wang, Xiaoming Li, Lin Guo
This paper presents an architectural design and evaluation result of an efficient Web-crawling system. The design involves a fully distributed architecture, a URL allocating algorithm, and a method...
Wang, Jianyong., Ratnam, Manohar.
Typescript.
Wang, Jianyong, Karypis, George
Previous study has shown that mining frequent patterns with length-decreasing support constraint is very helpful in removing some uninteresting patterns based on the observation that short patterns...
Efficient Closed Pattern Mining in the Presence of Tough Block Constraints (1998)
Gade, Krishna, Wang, Jianyong, Karypis, George
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemset based constraints that...
SUMMARY: Efficiently Summarizing Transactions for Clustering (1998)
Wang, Jianyong, Karypis, George
Frequent itemset mining was initially proposed and has been studied extensively in the context of association rule mining. In recent years, several studies have also extended its application to the...
HARMONY: Efficiently Mining the Best Rules for Classification (1998)
Wang, Jianyong, Karypis, George
Many studies have shown that rule-based classification algorithms perform well in classifying categorical and sparse high-dimensional databases. However, a fundamental limitation with many rule-based...
SUMMARY: Efficiently Summarizing Transactions for Clustering (1998)
J. Wang, Jianyong Wang, Jianyong Wang, G. Karypis, George Karypis
Frequent itemset mining was initially proposed and has been studied extensively in the context of association rule mining. In recent years, several studies have also extended its application to the...