Browse

Modeling Long-Range Travelling Times with Big Railway Data (2022)
Conference Proceeding
Sun, W., Grubenmann, T., Cheng, R., Kao, B., & Ching, W. (2022). Modeling Long-Range Travelling Times with Big Railway Data. In Database Systems for Advanced Applications: 27th International Conference, DASFAA 2022 (443-454). https://doi.org/10.1007/978-3-031-00129-1_38

Big Railway Data, such as train movement logs and timetables, have become increasingly available. By analyzing these data, insights about train movement and delay can be extracted, allowing train operators to make smarter train management decisions.... Read More about Modeling Long-Range Travelling Times with Big Railway Data.

DeepTEA: effective and efficient online time-dependent trajectory outlier detection (2022)
Journal Article
Han, X., Cheng, R., Ma, C., & Grubenmann, T. (2022). DeepTEA: effective and efficient online time-dependent trajectory outlier detection. Proceedings of the VLDB Endowment, 15(7), 1493-1505. https://doi.org/10.14778/3523210.3523225

In this paper, we study anomalous trajectory detection, which aims to extract abnormal movements of vehicles on the roads. This important problem, which facilitates understanding of traffic behavior and detection of taxi fraud, is challenging due to... Read More about DeepTEA: effective and efficient online time-dependent trajectory outlier detection.

Leveraging Contextual Graphs for Stochastic Weight Completion in Sparse Road Networks (2022)
Conference Proceeding
Han, X., Cheng, R., Grubenmann, T., Maniu, S., Ma, C., & Li, X. (2022). Leveraging Contextual Graphs for Stochastic Weight Completion in Sparse Road Networks. In A. Banerjee, Z. Zhou, E. E. Papalexakis, & M. Riondato (Eds.), Proceedings of the 2022 SIAM International Conference on Data Mining (SDM) (64-72). https://doi.org/10.1137/1.9781611977172.8

Road network applications, such as navigation, incident detection, and Point-of-Interest (POI) recommendation, make extensive use of network edge weights (e.g., traveling times). Some of these weights can be missing, especially in a road network wher... Read More about Leveraging Contextual Graphs for Stochastic Weight Completion in Sparse Road Networks.

Spatial concept learning and inference on geospatial polygon data (2022)
Journal Article
Westphal, P., Grubenmann, T., Collarana, D., Bin, S., Bühmann, L., & Lehmann, J. (2022). Spatial concept learning and inference on geospatial polygon data. Knowledge-Based Systems, 241, Article 108233. https://doi.org/10.1016/j.knosys.2022.108233

Geospatial knowledge has always been an essential driver for many societal aspects. This concerns in particular urban planning and urban growth management. To gain insights from geospatial data and guide decisions usually authoritative and open data... Read More about Spatial concept learning and inference on geospatial polygon data.

A framework for differentially-private knowledge graph embeddings (2021)
Journal Article
Han, X., Dell’Aglio, D., Grubenmann, T., Cheng, R., & Bernstein, A. (2022). A framework for differentially-private knowledge graph embeddings. Journal of Web Semantics, 72, Article 100696. https://doi.org/10.1016/j.websem.2021.100696

Knowledge graph (KG) embedding methods are at the basis of many KG-based data mining tasks, such as link prediction and node clustering. However, graphs may contain confidential information about people or organizations, which may be leaked via embed... Read More about A framework for differentially-private knowledge graph embeddings.

Geolog: Scalable Logic Programming on Spatial Data (2021)
Conference Proceeding
Grubenmann, T., & Lehmann, J. (2021). Geolog: Scalable Logic Programming on Spatial Data. In Proceedings ICLP 2021 (191-204). https://doi.org/10.4204/eptcs.345.34

Spatial data is ubiquitous in our data-driven society. The Logic Programming community has been investigating the use of spatial data in different settings. Despite the success of this research, the Geographic Information System (GIS) community has r... Read More about Geolog: Scalable Logic Programming on Spatial Data.

Traffic Incident Detection: A Trajectory-based Approach (2020)
Conference Proceeding
Han, X., Grubenmann, T., Cheng, R., Wong, S. C., Li, X., & Sun, W. (2020). Traffic Incident Detection: A Trajectory-based Approach. In 2020 IEEE 36th International Conference on Data Engineering (ICDE). https://doi.org/10.1109/icde48307.2020.00190

Incident detection (ID), or the automatic discovery of anomalies from road traffic data (e.g., road sensor and GPS data), enables emergency actions (e.g., rescuing injured people) to be carried out in a timely fashion. Existing ID solutions based on... Read More about Traffic Incident Detection: A Trajectory-based Approach.

TSA: A Truthful Mechanism for Social Advertising (2020)
Conference Proceeding
Grubenmann, T., Cheng, R. C., & Lakshmanan, L. V. (2020). TSA: A Truthful Mechanism for Social Advertising. In WSDM '20: Proceedings of the 13th International Conference on Web Search and Data Mining (214-222). https://doi.org/10.1145/3336191.3371809

Social advertising exploits the interconnectivity of users in social networks to spread advertisement and generate user engagements. A lot of research has focused on how to select the best subset of users in a social network to maximize the number of... Read More about TSA: A Truthful Mechanism for Social Advertising.

Collaborative Streaming: Trust Requirements for Price Sharing (2019)
Conference Proceeding
Grubenmann, T., Dell'Aglio, D., & Bernstein, A. (2019). Collaborative Streaming: Trust Requirements for Price Sharing. In 2019 IEEE International Conference on Big Data (Big Data). https://doi.org/10.1109/bigdata47090.2019.9005470

Stream Processing (SP) is an important Big Data technology enabling continuous querying of data streams. The stream setting offers the opportunity to exploit synergies and, theoretically, share the access and processing costs between multiple differe... Read More about Collaborative Streaming: Trust Requirements for Price Sharing.

LINC: a motif counting algorithm for uncertain graphs (2019)
Journal Article
Ma, C., Cheng, R., Lakshmanan, L. V. S., Grubenmann, T., Fang, Y., & Li, X. (2019). LINC: a motif counting algorithm for uncertain graphs. Proceedings of the VLDB Endowment, 13(2), 155-168. https://doi.org/10.14778/3364324.3364330

In graph applications (e.g., biological and social networks), various analytics tasks (e.g., clustering and community search) are carried out to extract insight from large and complex graphs. Central to these tasks is the counting of the number of mo... Read More about LINC: a motif counting algorithm for uncertain graphs.

Make restaurants pay your server bills (2018)
Conference Proceeding
Grubenmann, T., Dell’Aglio, D., Bernstein, A., Moor, D., & Seuken, S. (2018). Make restaurants pay your server bills.

So far, the Web of Data (WoD) has only marginally considered the problem of financing itself. In most of the cases, research funds (either public or private) and donations are supporting the creation and maintenance of WoD services. Applying typical... Read More about Make restaurants pay your server bills.

Monetization Strategies for the Web of Data (2018)
Conference Proceeding
Grubenmann, T. (2018). Monetization Strategies for the Web of Data. In WWW '18: Companion Proceedings of the The Web Conference 2018 (813-817). https://doi.org/10.1145/3184558.3186568

Inspired by the World Wide Web, the Web of Data is a network of interlinked data fragments. One of the main advantages of the Web of Data is that all of its content is processable by machines. However, this also has its drawbacks when it comes to mon... Read More about Monetization Strategies for the Web of Data.

Financing the Web of Data with Delayed-Answer Auctions (2018)
Conference Proceeding
Grubenmann, T., Bernstein, A., Moor, D., & Seuken, S. (2018). Financing the Web of Data with Delayed-Answer Auctions. In WWW '18: Proceedings of the 2018 World Wide Web Conference (1033-1042). https://doi.org/10.1145/3178876.3186002

The World Wide Web is a massive network of interlinked documents. One of the reasons the World Wide Web is so successful is the fact that most content is available free of any charge. Inspired by the success of the World Wide Web, the Web of Data app... Read More about Financing the Web of Data with Delayed-Answer Auctions.

Decentralizing the Semantic Web: Who Will Pay to Realize It? (2017)
Conference Proceeding
Grubenmann, T., Dell'Aglio, D., Bernstein, A., Moor, D., & Seuken, S. (2017). Decentralizing the Semantic Web: Who Will Pay to Realize It?. In Proceedings of the Workshop on Decentralizing the Semantic Web 2017 co-located with 16th International Semantic Web Conference (ISWC 2017)

Fueled by enthusiasm of volunteers, government subsidies, and open data legislation, the Web of Data (WoD) has enjoyed a phenomenal growth. Commercial data, however, has been stuck in proprietary silos, as the monetization strategy for sharing data i... Read More about Decentralizing the Semantic Web: Who Will Pay to Realize It?.

Challenges of Source Selection in the WoD (2017)
Conference Proceeding
Grubenmann, T., Bernstein, A., Moor, D., & Seuken, S. (2017). Challenges of Source Selection in the WoD. In The Semantic Web – ISWC 2017 16th International Semantic Web Conference, Vienna, Austria, October 21–25, 2017, Proceedings, Part I (313-328). https://doi.org/10.1007/978-3-319-68288-4_19

Federated querying, the idea to execute queries over several distributed knowledge bases, lies at the core of the semantic web vision. To accommodate this vision, SPARQL provides the SERVICE keyword that allows one to allocate sub-queries to servers.... Read More about Challenges of Source Selection in the WoD.

Core-selecting payment rules for combinatorial auctions with uncertain availability of goods (2016)
Conference Proceeding
Moor, D., Seuken, S., Grubenmann, T., & Bernstein, A. (2016). Core-selecting payment rules for combinatorial auctions with uncertain availability of goods. In Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI-16) (424-432)

In some auction domains, there is uncertainty regarding the final availability of the goods being auctioned off. For example, a government may auction off spectrum from its public safety network, but it may need this spectrum back in times of emergen... Read More about Core-selecting payment rules for combinatorial auctions with uncertain availability of goods.

A Double Auction for Querying the Web of Data (2015)
Conference Proceeding
Moor, D., Grubenmann, T., Seuken, S., & Bernstein, A. (2015). A Double Auction for Querying the Web of Data. In The Third Conference on Auctions, Market Mechanisms and Their Applications. https://doi.org/10.4108/eai.8-8-2015.2260632

Currently, the Web of Data (WoD) suffers from a lack of incentives for data providers. In this paper, we address this issue by designing a double auction to allocate answers (from data providers) to queries in the WoD. However, our domain exhibits a... Read More about A Double Auction for Querying the Web of Data.

FedMark: A Marketplace for Federated Data on the Web
Working Paper
Grubenmann, T., Bernstein, A., Moor, D., & Seuken, S. (2018). FedMark: A Marketplace for Federated Data on the Web

The Web of Data (WoD) has experienced a phenomenal growth in the past. This growth is mainly fueled by tireless volunteers, government subsidies, and open data legislations. The majority of commercial data has not made the transition to the WoD, yet.... Read More about FedMark: A Marketplace for Federated Data on the Web.