Related papers: FastJet: a code for fast k_t clustering, and more
We present a next-to-leading order QCD calculation for the single-inclusive production of collimated jets at hadron colliders, when the jet is defined by maximizing a suitable jet function that depends on the momenta of final-state…
Clustering is a widely used technique in data mining applications for discovering patterns in underlying data. Most traditional clustering algorithms are limited to handling datasets that contain either numeric or categorical attributes.…
We present the first application of a recently-developed effective theory of jet propagation in matter SCETG to inclusive hadron suppression in nucleus-nucleus collisions at the LHC. SCETG-based splitting kernels allow us to go beyond the…
Clustering is an effective technique in data mining to generate groups that are the matter of interest. Among various clustering approaches, the family of k-means algorithms and min-cut algorithms gain most popularity due to their…
In this plenary talk I discuss soft-collinear effective theory (SCET) as a framework for precision QCD phenomenology. Emphasis is placed on jet and heavy flavor observables accessible at current and future collider facilities. One of the…
Subspace clustering (SC) is a promising clustering technology to identify clusters based on their associations with subspaces in high dimensional spaces. SC can be classified into hard subspace clustering (HSC) and soft subspace clustering…
Most methods for time series classification that attain state-of-the-art accuracy have high computational complexity, requiring significant training time even for smaller datasets, and are intractable for larger datasets. Additionally, many…
We present methods for k-means clustering on a stream with a focus on providing fast responses to clustering queries. Compared to the current state-of-the-art, our methods provide substantial improvement in the query time for cluster…
We compute the leading clustering (abelian non-global) logarithms, which arise in the distribution of non-global QCD observables when final-state partons are clustered using the $k_t$ jet algorithm, up to six loops in perturbation theory.…
We examine the efficiency of clustering a set of points, when the encompassing metric space may be preprocessed in advance. In computational problems of this genre, there is a first stage of preprocessing, whose input is a collection of…
Air traffic controllers benefit from referencing historical dates with similar complex air traffic conditions to identify potential management measures and their effects, which is critical for understanding air transportation system laws…
Fast radio transient search algorithms identify signals of interest by iterating and applying a threshold on a set of matched filters. These filters are defined by properties of the transient such as time and dispersion. A real transient…
K-means Clustering is the most well-known partitioning algorithm among all clustering, by which we can partition the data objects very easily in to more than one clusters. However, for K-means to choose an appropriate number of clusters…
Modern machine learning techniques, such as convolutional, recurrent and recursive neural networks, have shown promise for jet substructure at the Large Hadron Collider. For example, they have demonstrated effectiveness at boosted top or W…
We present three quantum algorithms for clustering graphs based on higher-order patterns, known as motif clustering. One uses a straightforward application of Grover search, the other two make use of quantum approximate counting, and all of…
Spectral clustering has become a popular technique due to its high performance in many contexts. It comprises three main steps: create a similarity graph between N objects to cluster, compute the first k eigenvectors of its Laplacian matrix…
Since the machine learning techniques are improving rapidly, it has been shown that the image recognition techniques in deep neural networks can be used to detect jet substructure. And it turns out that deep neural networks can match or…
DO has implemented and calibrated a KT jet algorithm for the first time in a ppbar collider. We present two results based on 1992-1996 data which were recently published: the subjet multiplicity in quark and gluon jets and the central…
Clustering algorithms aim to organize data into groups or clusters based on the inherent patterns and similarities within the data. They play an important role in today's life, such as in marketing and e-commerce, healthcare, data…
In this work, we describe how infrared-collinear safety can be restored perturbatively for standard definitions of jets and jet flavour. We will explicitly study this approach at next-to-next-to-leading order in QCD, where we will discuss…