高级检索

 作者：Srikanta Tirthapura , Michael J. Sanderson 来源：[J].Knowledge and Information Systems(IF 2.225), 2014, Vol.41 (3), pp.559-590Springer 摘要：Abstract(#br)The problem of mining collections of trees to identify common patterns, called frequent subtrees (FSTs), arises often when trying to interpret the results of phylogenetic analysis. FST mining generalizes the well-known maximum agreement subtree problem. Here we ...
 作者：Apurba Das , Michael Svendsen , Srikanta Tirthapura 来源：[J].The VLDB Journal(IF 1.395), 2019, Vol.28 (3), pp.351-375Springer 摘要：Abstract(#br)We consider the maintenance of the set of all maximal cliques in a dynamic graph that is changing through the addition or deletion of edges. We present nearly tight bounds on the magnitude of change in the set of maximal cliques when edges are added to the graph, as ...
 作者：Michael Svendsen , Arko Provo Mukherjee , Srikanta Tirthapura 来源：[J].Journal of Parallel and Distributed Computing(IF 0.859), 2015, Vol.79-80, pp.104-114Elsevier 摘要：Abstract(#br)We consider Maximal Clique Enumeration (MCE) from a large graph. A maximal clique is perhaps the most fundamental dense substructure in a graph, and MCE is an important tool to discover densely connected subgraphs, with numerous applications to data mining on web gra...
 作者：Sneha Aman Singh , Srikanta Tirthapura 来源：[J].Journal of Parallel and Distributed Computing(IF 0.859), 2014, Vol.74 (11), pp.3115-3127Elsevier 摘要：Abstract(#br)A persistent item in a stream is one that occurs regularly in the stream without necessarily contributing significantly to the volume of the stream. Persistent items are often associated with anomalies in network streams, such as botnet traffic and click fraud. While...
 作者：Srikanta Tirthapura , David P. Woodruff 来源：[J].Algorithmica(IF 0.488), 2015, Vol.73 (2), pp.235-260Springer 摘要：Abstract(#br)On a stream $${\fancyscript{S}}$$ of two dimensional data items $$(x,y)$$ where $$x$$ is an item identifier and $$y$$ is a numerical attribute, a correlated aggregate query $$C(\sigma ,AGG,{\fancyscript{S}})$$ asks to first apply a selection predicate $$\sigma$$ alo...
 作者：... A. Pavan , Srikanta Tirthapura , David P. Woodruff 来源：[J].Algorithmica(IF 0.488), 2016, Vol.74 (2), pp.787-811Springer 摘要：Abstract(#br)In many stream monitoring situations, the data arrival rate is so high that it is not even possible to observe each element of the stream. The most common solution is to sub-sample the data stream and use the sample to infer properties and estimate aggregates of the ...
 作者：Bibudh Lahiri , Arko Provo Mukherjee , Srikanta Tirthapura 来源：[J].Data Mining and Knowledge Discovery(IF 2.877), 2016, Vol.30 (4), pp.797-818Springer 摘要：Abstract(#br)We consider online mining of correlated heavy-hitters (CHH) from a data stream. Given a stream of two-dimensional data, a correlated aggregate query first extracts a substream by applying a predicate along a primary dimension, and then computes an aggregate alon...
 作者：Costas Busch , Ryan LaFortune , Srikanta Tirthapura 来源：[J].Algorithmica(IF 0.488), 2014, Vol.69 (3), pp.658-684Springer 摘要：Abstract(#br)We consider the construction of sparse covers for planar graphs and other graphs that exclude a fixed minor. We present an algorithm that gives a cover for the γ -neighborhood of each node. For planar graphs, the cover has radius less than 16 γ and degree no mor...
 作者：... Divesh Srivastava , Michael Svendsen , Srikanta Tirthapura 来源：[J].The VLDB Journal(IF 1.395), 2014, Vol.23 (2), pp.175-199Springer 摘要：Abstract(#br)Recent years have witnessed an unprecedented proliferation of social media. People around the globe author, everyday, millions of blog posts, social network status updates, etc. This rich stream of information can be used to identify, on an ongoing basis, emerging st...
 作者：Zhenhui Shen , Srikanta Tirthapura 来源：[J].Journal of Parallel and Distributed Computing(IF 0.859), 2012, Vol.72 (12), pp.1591-1602Elsevier 摘要：Abstract(#br)Subscription covering is an optimization that reduces the number of subscriptions propagated, and hence, the size of routing tables, in a content-based publish-subscribe system. However, detecting covering relationships among subscriptions can be a costly computation...