The European Conference on Machine Learning started out in 1986 as the European Working Session o... more The European Conference on Machine Learning started out in 1986 as the European Working Session on Learning and has quickly become the premier European conference of the field, attracting submissions from all over the world. Since 7 years, the ECML is collocated with the European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD). This year, 521 papers have been submitted to ECML/PKDD.
Abstract Suppose we are given a multi-dimensional dataset. For every point in the dataset, we cre... more Abstract Suppose we are given a multi-dimensional dataset. For every point in the dataset, we create a transaction, or cart, in which we store the k-nearest neighbors of that point for one of the given dimensions. The resulting collection of carts can then be used to mine frequent itemsets; that is, sets of points that are frequently seen together in some dimensions.
Abstract We present an approach for mining frequent conjunctive in arbitrary relational databases... more Abstract We present an approach for mining frequent conjunctive in arbitrary relational databases. Our pattern class is the simple, but appealing subclass of simple conjunctive queries. Our algorithm, called Conqueror^+, is capable of detecting previously unknown functional and inclusion dependencies that hold on the database relations as well as on joins of relations. These newly detected dependencies are then used to prune redundant queries.
Abstract: A computer-implemented method and system for ranking information in an information syst... more Abstract: A computer-implemented method and system for ranking information in an information system comprising linked objects is disclosed.
The Industry and Government Track of the IEEE ICDM conference will bring together academics and p... more The Industry and Government Track of the IEEE ICDM conference will bring together academics and practitioners to discuss data mining challenges and opportunities that are emerging in both industry and government. Issues that will be addressed include how to intelligently leverage novel data sources (eg social media data, networked data, textual data), taking into account issues as privacy, big data and heterogenous datasets, and the application of novel data mining algorithms.
In this work we describe a recommendation system based upon user-generated description (tags) of ... more In this work we describe a recommendation system based upon user-generated description (tags) of content. In particular, we describe an experimental system (GaMuSo) that consists of more than 140.000 user-defined tags for over 400.000 artists. From this data we constructed a bipartite graph, linking artists via tags to other artists. On the resulting graph we compute related artists for an initial artist of interest.
Abstract The severity of a reported bug is a critical factor in deciding how soon it needs to be ... more Abstract The severity of a reported bug is a critical factor in deciding how soon it needs to be fixed. Unfortunately, while clear guidelines exist on how to assign the severity of a bug, it remains an inherent manual process left to the person reporting the bug. In this paper we investigate whether we can accurately predict the severity of a reported bug by analyzing its textual description using text mining algorithms.
We present an algorithm for mining frequent queries in arbitrary relational databases, over which... more We present an algorithm for mining frequent queries in arbitrary relational databases, over which functional dependencies are assumed. Building upon previous results, we restrict to the simple, but appealing subclass of simple conjunctive queries. The proposed algorithm makes use of the functional dependencies of the database to optimise the generation of queries and prune redundant queries.
The Belgian railway network has a high traffic density with Brussels as its gravity center. The s... more The Belgian railway network has a high traffic density with Brussels as its gravity center. The star-shape of the network implies heavily loaded bifurcations in which knock-on delays are likely to occur. Knock-on delays should be minimized to improve the total punctuality in the network. Based on experience, the most critical junctions in the traffic flow are known, but others might be hidden.
The European Conference on Machine Learning started out in 1986 as the European Working Session o... more The European Conference on Machine Learning started out in 1986 as the European Working Session on Learning and has quickly become the premier European conference of the field, attracting submissions from all over the world. Since 7 years, the ECML is collocated with the European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD). This year, 521 papers have been submitted to ECML/PKDD.
Abstract Suppose we are given a multi-dimensional dataset. For every point in the dataset, we cre... more Abstract Suppose we are given a multi-dimensional dataset. For every point in the dataset, we create a transaction, or cart, in which we store the k-nearest neighbors of that point for one of the given dimensions. The resulting collection of carts can then be used to mine frequent itemsets; that is, sets of points that are frequently seen together in some dimensions.
Abstract We present an approach for mining frequent conjunctive in arbitrary relational databases... more Abstract We present an approach for mining frequent conjunctive in arbitrary relational databases. Our pattern class is the simple, but appealing subclass of simple conjunctive queries. Our algorithm, called Conqueror^+, is capable of detecting previously unknown functional and inclusion dependencies that hold on the database relations as well as on joins of relations. These newly detected dependencies are then used to prune redundant queries.
Abstract: A computer-implemented method and system for ranking information in an information syst... more Abstract: A computer-implemented method and system for ranking information in an information system comprising linked objects is disclosed.
The Industry and Government Track of the IEEE ICDM conference will bring together academics and p... more The Industry and Government Track of the IEEE ICDM conference will bring together academics and practitioners to discuss data mining challenges and opportunities that are emerging in both industry and government. Issues that will be addressed include how to intelligently leverage novel data sources (eg social media data, networked data, textual data), taking into account issues as privacy, big data and heterogenous datasets, and the application of novel data mining algorithms.
In this work we describe a recommendation system based upon user-generated description (tags) of ... more In this work we describe a recommendation system based upon user-generated description (tags) of content. In particular, we describe an experimental system (GaMuSo) that consists of more than 140.000 user-defined tags for over 400.000 artists. From this data we constructed a bipartite graph, linking artists via tags to other artists. On the resulting graph we compute related artists for an initial artist of interest.
Abstract The severity of a reported bug is a critical factor in deciding how soon it needs to be ... more Abstract The severity of a reported bug is a critical factor in deciding how soon it needs to be fixed. Unfortunately, while clear guidelines exist on how to assign the severity of a bug, it remains an inherent manual process left to the person reporting the bug. In this paper we investigate whether we can accurately predict the severity of a reported bug by analyzing its textual description using text mining algorithms.
We present an algorithm for mining frequent queries in arbitrary relational databases, over which... more We present an algorithm for mining frequent queries in arbitrary relational databases, over which functional dependencies are assumed. Building upon previous results, we restrict to the simple, but appealing subclass of simple conjunctive queries. The proposed algorithm makes use of the functional dependencies of the database to optimise the generation of queries and prune redundant queries.
The Belgian railway network has a high traffic density with Brussels as its gravity center. The s... more The Belgian railway network has a high traffic density with Brussels as its gravity center. The star-shape of the network implies heavily loaded bifurcations in which knock-on delays are likely to occur. Knock-on delays should be minimized to improve the total punctuality in the network. Based on experience, the most critical junctions in the traffic flow are known, but others might be hidden.
Uploads
Papers by Bart Goethals