• Publications
  • Influence
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
We derive the joint equilibrium distribution of queue sizes in a network of queues containing N service centers and R classes of customers. The equilibrium state probabilities have the general form:Expand
  • 1,704
  • 116
STING: A Statistical Information Grid Approach to Spatial Data Mining
Spatial data mining, i.e., discovery of interesting characteristics and patterns that may implicitly exist in spatial databases, is a challenging task due to the huge amounts of spatial data and toExpand
  • 1,276
  • 75
Frequent Subtree Mining - An Overview
Mining frequent subtrees from databases of labeled trees is a new research field that has many practical applications in areas such as computer networks, Web mining, bioinformatics, XML documentExpand
  • 310
  • 36
A Probabilistic Room Location Service for Wireless Networked Environments
The popularity of wireless networks has increased in recent years and is becoming a common addition to LANs. In this paper we investigate a novel use for a wireless network based on the IEEE 802.11Expand
  • 570
  • 35
Moment: maintaining closed frequent itemsets over a stream sliding window
This paper considers the problem of mining closed frequent itemsets over a sliding window using limited memory space. We design a synopsis data structure to monitor transactions in the sliding windowExpand
  • 342
  • 32
Mining Closed and Maximal Frequent Subtrees from Databases of Labeled Rooted Trees
Tree structures are used extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. One important problem in mining databases of trees isExpand
  • 145
  • 25
Performance Analysis of Disk Arrays under Failure
Disk arrays (RAID) have been proposed as a possible approach to solving the emerging I/O bottleneck problem. The performance of a RAID system when all disks are operational and the MTTF,,, (mean timeExpand
  • 205
  • 23
CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees
Tree structures are used extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. One important problem in mining databases of trees isExpand
  • 142
  • 17
HybridTreeMiner: an efficient algorithm for mining frequent rooted trees and free trees using canonical forms
  • Y. Chi, Y. Yang, R. Muntz
  • Computer Science, Mathematics
  • Proceedings. 16th International Conference on…
  • 21 June 2004
Tree structures are used extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. In this paper, we present HybridTreeMiner, aExpand
  • 144
  • 17
Catch the moment: maintaining closed frequent itemsets over a data stream sliding window
This paper considers the problem of mining closed frequent itemsets over a data stream sliding window using limited memory space. We design a synopsis data structure to monitor transactions in theExpand
  • 184
  • 16