I present a web service for querying an embedding of entities in the Wikidata knowledge graph. The embedding is trained on the Wikidata dump using Gensim's Word2Vec implementation and a simple graph walk. A REST API is implemented. Together with the Wikidata API the web service exposes a multilingual resource for over …
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
169,051 papers · 148 categories
Trend · papers per month
48 results for “web services”
Unified machine learning framework for deep learning and web services.
problem Deep learning and web service challenges.
method MMLSpark expands Spark to deep learning, micro-service orchestration, etc.
result Unified API for deep learning and web services.
Automated service classification plays a crucial role in service discovery, selection, and composition. Machine learning has been widely used for service classification in recent years. However, the performance of conventional machine learning methods highly depends on the quality of manual feature engineering. In this…
Automates organizing diverse web data into a hierarchical topic model.
problem Manual classification of all scientific and popular scientific knowledge is impractical.
method Proposes an algorithm to aggregate multiple collections into a single hierarchical topic model.
result Demonstrates a web service for topical exploratory search.
Web browser autofill predicts form field labels for convenience.
problem Predicting form field labels for autofill in web browsers.
method Machine learning solution implemented as a web service using Azure ML Studio.
result Improved form field label prediction for autofill.
With the growth of user-generated content, we observe the constant rise of the number of companies, such as search engines, content aggregators, etc., that operate with tremendous amounts of web content not being the services hosting it. Thus, aiming to locate the most important content and promote it to the users, the…
We propose a continuum model for the description of buyer and seller dynamics in an Internet market. The relevant variables are the research effort of buyers and the sellers' reputation building process. We show that, if a commercial web-site gives consumers the possibility to rate credibly sellers they bargained with,…
Locality-sensitive hashing speeds up web app security testing.
problem Challenges in crawling Rich Internet Applications (RIAs) due to state similarity.
method Uses MinHash sketches to analyze DOM structures and estimate similarity.
result Successfully scans RIAs that traditional crawling methods cannot.
We describe a project, called the "Discretization in Geometry and Dynamics Gallery", or DGD Gallery for short, whose goal is to store geometric data and to make it publicly available. The DGD Gallery offers an online web service for the storage, sharing, and publication of digital research data.
TIMeSynC combines financial service interactions for intent prediction.
problem Aligning and learning from multi-domain, multi-resolution sequences for accurate intent prediction.
method An encoder-decoder transformer model addressing sequence alignment, temporal dynamics, and dynamic/static sequence combination.
result Significant improvement in intent prediction over existing methods.
SVM algorithm extracts digits from audio CAPTCHAs.
problem Recognizing audio CAPTCHAs from computer programs.
method Used RastaPLP features and SVM algorithm.
result Successfully extracted digits from audio CAPTCHAs.
Efficiently projects points onto polytopes, especially useful in web-scale applications.
problem Efficiently projecting points onto polytopes in large-scale applications.
method Developed a vertex-oriented incremental algorithm for polytope projection, tailored for simplex and unit-box cut polytopes.
result Majority of projections lie on vertices of polytopes, leading to significant performance improvements.
Voice-controlled e-commerce app enhances user experience for visually impaired.
problem Limited user experience for visually impaired in e-commerce applications.
method Proposes a voice-controlled e-commerce application using IBM Watson speech-to-text.
result Demonstrates enhanced usability for visually impaired users.
Modern Internet services, such as those at Google, Yahoo!, and Amazon, handle billions of requests per day on clusters of thousands of computers. Because these services operate under strict performance requirements, a statistical understanding of their performance is of great practical interest. Such services are model…
Counterfactual learning is a natural scenario to improve web-based machine translation services by offline learning from feedback logged during user interactions. In order to avoid the risk of showing inferior translations to users, in such scenarios mostly exploration-free deterministic logging policies are in place. …
DCE learns customer embeddings from digital activity and financial context.
problem Comprehensive customer understanding in financial services.
method Leverages customers' digital activity and financial context to learn dense representations.
result DCE showed performance lift in three prediction problems.
We introduce and describe the results of a novel shared task on bandit learning for machine translation. The task was organized jointly by Amazon and Heidelberg University for the first time at the Second Conference on Machine Translation (WMT 2017). The goal of the task is to encourage research on learning machine tra…
Efficient algorithm for optimizing web page layouts in real-time.
problem Optimizing web pages for conversions and click-through rates is challenging due to the large decision space and interactions between components.
method Formulated a multivariate optimization approach using bandit methodology for efficient exploration and hill-climbing for optimal selection in real-time.
result Achieved a 21% conversion increase after a single week of online optimization.
YOLOv3 detects ships in real-time with high accuracy.
problem Real-time target detection in maritime scenarios.
method YOLOv3 model trained on a large dataset of marine vessels.
result Average Precision up to 96% for IoU of 0.5.
The collection and analysis of user data drives improvements in the app and web ecosystems, but comes with risks to privacy. This paper examines discrete distribution estimation under local privacy, a setting wherein service providers can learn the distribution of a categorical statistic of interest without collecting …
Semi-supervised model removes noisy content from webpages.
problem Extracting relevant content from webpages with ads and noise.
method Graph representation of webpage, semi-supervised learning with Gaussian Random Fields.
result Preliminary results show successful extraction of relevant content.
In this paper, we show how using publicly available data streams and machine learning algorithms one can develop practical data driven services with no input from domain experts as a form of prior knowledge. We report the initial steps toward development of a real estate portal in Switzerland. Based on continuous web c…
West Frisian lemmatizer, POS tagger, and parser created.
problem Creating accurate lemmatization, POS tagging, and dependency parsing for West Frisian.
method Using a corpus of 44,714 words annotated according to Universal Dependency version 2. Applying Dutch POS tags and morphological/syntactic annotations to create Frisian translations.
result Significant improvement in lemma accuracy compared to default parameters.
This paper analyzes CNNs for malware detection in cloud IaaS.
problem Malware vulnerability in cloud IaaS environments.
method Analysis of Convolutional Neural Networks (CNNs) for online malware detection using process-level performance metrics.
result State-of-the-art DenseNets and ResNets effectively detect malware in online cloud systems.
In many online applications interactions between a user and a web-service are organized in a sequential way, e.g., user browsing an e-commerce website. In this setting, recommendation system acts throughout user navigation by showing items. Previous works have addressed this recommendation setup through the task of pre…
AI detects LDDoS attacks by analyzing TCP connection parameters.
problem Detecting low-rate LDDoS attacks that overwhelm server connections.
method AI algorithms trained on simulated and real-world datasets using TCP flow features.
result Decision trees and k-NN achieved high accuracy in classifying attacks, with low false positives and negatives.
Unsupervised and Interpretable Domain Adaptation to Rapidly Filter Tweets for Emergency Servicescs.CL
Unsupervised learning filters tweets for emergency services during crises.
problem Challenges in filtering relevant information from social web data during disasters.
method Multi-task domain adversarial attention network for unsupervised domain adaptation.
result The multi-task model outperforms single task models in filtering relevant tweets.
We present ease.ml, a declarative machine learning service platform we built to support more than ten research groups outside the computer science departments at ETH Zurich for their machine learning needs. With ease.ml, a user defines the high-level schema of a machine learning application and submits the task via a W…
Formula calculates MOY webs and link polynomials.
problem No specific problem stated; focuses on evaluation.
method Closed formula for exterior webs and link polynomials.
result Closed formula for evaluating MOY webs and link polynomials.
We find an invariant characterization of planar webs of maximum rank. For 4-webs, we prove that a planar 4-web is of maximum rank three if and only if it is linearizable and its curvature vanishes. This result leads to the direct web-theoretical proof of the Poincaré's theorem: a planar 4-web of maximum rank is lineari…
Classifies hexagonal circular 3-webs with cubic polar curves.
problem Classifying hexagonal circular 3-webs with algebraic polar curves of degree three.
method Analyzes hexagonal circular 3-webs on unit sphere with polar points on a twisted cubic.
result Completes the classification of hexagonal circular 3-webs with algebraic polar curves of degree three.
We construct flat 3-webs via semi-simple geometric Frobenius manifolds of dimension three and give geometric interpretation of the Chern connection of the web. These webs turned out to be biholomorphic to the characteristic webs on the solutions of the corresponding associativity equation. We show that such webs are he…
We give various results and applications using the connection associated with a -web. Precisely, we exhibit fundamental invariants of the web related to the differential equation of first order which presents the web. They cast some new lights on the connection and its construction, both conceptually an…
We investigate the linearizability problem for different classes of 4-webs in the plane. In particular, we apply a recently found in [AGL] the linearizability conditions for 4-webs in the plane to confirm that a 4-web MW (Mayrhofer's web) with equal curvature forms of its 3-subwebs and a nonconstant basic invariant is …
In the present paper we study geometric structures associated with webs of hypersurfaces. We prove that with any geodesic (n+2)-web on an n-dimensional manifold there is naturally associated a unique projective structure and, provided that one of web foliations is pointed, there is also associated a unique affine struc…
Study local invariants of divergence-free webs in geometry.
problem Characterize triviality of divergence-free webs.
method Introduce two local invariants: differential and geometric.
result Triviality of either invariant characterizes trivial divergence-free web-germs.
This paper has been withdrawn by the authors due to the fact that the webs considered in the paper are ``Veronese-like webs'' which are different from Veronese webs.
Anonymizes speech data to protect privacy.
problem Protecting personal speech data from misuse.
method Extracts features, uses x-vectors, and neural models to synthesize anonymized speech.
result Effective in concealing speaker identities without compromising speech quality.
Investigates webs related to cluster algebras and polylogarithms.
problem Understanding webs associated with cluster algebras and polylogarithms.
method Introducing AMP webs and analyzing their properties, proving results and conjectures.
result Many webs associated with polylogarithms and cluster algebras are AMP webs.
We present a projectively invariant description of planar linear 3-webs. For a non-hexagonal 3-web, we introduce family of projective torsion-free Cartan connections, the web leaves being geodesics for each member of the family, and give a web linearization criterion. Finally, we propose an algorithm for resolving the …
Much information available on the web is copied, reused or rephrased. The phenomenon that multiple web sources pick up certain information is often called trend. A central problem in the context of web data mining is to detect those web sources that are first to publish information which will give rise to a trend. We p…
For a four-dimensional (nonisoclinicly geodesic) three-web W (3, 2, 2), a transversal distribution is defined by the torsion tensor of the web. In general, this distribution is not integrable. The authors find necessary and sufficient conditions of its integrability and prove the existence theorem for webs W (3, 2,…
In this paper we study the linearizability problem for 3-webs on a 2-dimensional manifold. With an explicit computation based on the theory developed in the paper "On the linearizability of 3-webs" (Nonlinear analysis 47, (2001) pp. 2643-2654), we examine a 3-web whose linearizability was claimed in the same paper. We …
Veronese webs appear as the natural way of passing to the quotient of curves in the projective space. In thi paper, we give the link between classical multidimensionnal webs and veronse webs by mean of interpolation.
New hexagonal circular 3-webs with reducible curves classified.
problem Classifying hexagonal circular 3-webs with reducible polar curves of degree 3.
method New examples and classifications presented.
result Classification of hexagonal circular 3-webs with reducible polar curves of degree 3.
Linv invariant and web spacemath.GT
In this paper, we reconstruct Kuperberg's web space. We introduce a new web (a trivalent diagram) and new relations between Kuperberg's web diagrams and the new diagram. Using the webs, we define crossing formulas corresponding to R-matrices associated to some irreducible representations and calculate…
On Gronwall conjecturemath.DG
Gronwall conjecture states that a planar 3-web which admits more than one distinct linearization is locally equivalent to an algebraic web. We give a partial answer to the conjecture in the affirmative for the class of planar 3-webs with the web curvature that vanishes to order three at a point. The differential relati…
We find relative differential invariants of orders eight and nine for a planar nonparallelizable 3-web such that their vanishing is necessary and sufficient for a 3-web to be linearizable. This solves the Blaschke conjecture for 3-webs. As a side result, we show that the number of linearizations in the Gronwall conject…