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…
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,341 papers · 148 categories
Trend · papers per month
48 results for “Web data”
New method infers missing categorical data from Web markup.
problem Missing information in Web markup nodes.
method Supervised approach for inferring categorical properties.
result Significantly outperforms existing baselines with 79% and 83% F1 score.
Paper introduces a new web robot traffic generator.
problem Lack of realistic web robot traffic generators.
method Statistical and Bayesian models fitted to robot traffic data.
result Generated traffic mimics real robot traffic characteristics.
This paper reviews sentiment analysis on Indian languages.
problem Understanding sentiment in multilingual web data.
method Reviews and discusses approaches for sentiment analysis on Indian languages.
result Challenges in sentiment analysis on indigenous languages.
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.
Study uses online data to identify malicious websites, addressing imbalance.
problem Identifying malicious websites from many more benign ones.
method Integrated resampling approach combining SMOTE and PSO.
result Proposed approach outperforms other resampling methods.
Study spider evaluations and web group representations using algebraic topology.
problem Evaluate and represent the topology of web groups using algebraic methods.
method Analyze the fundamental groups of planar webs, associate irreducible components and graded subalgebras, and use Poincaré polynomials.
result Spider evaluations correspond to symmetrized Poincaré polynomials of associated graded subalgebras.
Study identifies methods for handling sparse data in web settings with contextual bandits.
problem Handling sparse data in web settings with contextual bandits.
method Identified and categorized methods for addressing sparse data issues.
result Updated understanding of sparse data problems using contextual bandits in web settings.
Fast, format-agnostic web content detection for security.
problem Detecting malicious web content efficiently and accurately.
method Deep learning on static HTML tokens, avoiding complex parsing.
result 97.5% detection rate at 0.1% false positive rate.
New approach adds web datasets to carbon pricing models.
problem Integrating web datasets into carbon pricing models.
method Proposes open information, tests with VAR and GARCH-X.
result Web datasets like GDELT can significantly affect carbon pricing.
HTMLPhish detects phishing web pages using deep learning on HTML content.
problem Growing phishing attacks on the web require new detection methods.
method HTMLPhish uses Convolutional Neural Networks (CNNs) to classify HTML documents as phishing or benign.
result HTMLPhish achieves over 93% accuracy in detecting phishing web pages.
Paper explores methods to improve web search ranking.
problem Improving web search ranking accuracy with varied test data.
method Model Interpolation and Boosting Algorithm.
result Model Interpolation achieves best results on open test sets.
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.
WebGUM learns web navigation from multimodal data, outperforming previous methods.
problem Limited generalization from domain-specific models in web navigation.
method Instruction-following multimodal agent trained on vision-language foundation models.
result Significant improvement in web navigation performance on benchmarks.
After shortly recalling the construction of the Khovanov-Kuperberg algebras, we give a characterisation of indecomposable web-modules. It says that a web-module is indecomposable if and only if one can deduce it directly from the Kuperberg bracket (via a Schur lemma argument). The proofs relies on the construction of i…
Transfer learning improves understanding of users on new Web platforms.
problem Lack of knowledge about novel phenomena on new Web platforms due to data sparsity.
method TraNet, a transfer learning-based approach, adapts knowledge from one domain to another.
result TraNet outperforms other approaches in transferring knowledge about users across different Web platforms.
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.
Predicts cyber attacks using web source signals.
problem Growing frequency and severity of cyber attacks.
method Machine learning techniques based on deep neural networks and autoregressive time series models.
result Significant lift in F1 score for predicting cyber attacks.
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…
ConsMRF uses ADMM for scalable multi-relational learning.
problem Scalability issues in multi-relational learning for large datasets.
method ConsMRF uses ADMM for consensus optimization of multi-relational data.
result ConsMRF outperforms competitors on large Web datasets.
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…
Projective invariants described for 3-web geometry, resolving Gronwall's conjecture.
problem Projective invariants of linear 3-webs and resolving Gronwall's conjecture.
method Projective torsion-free Cartan connections, web leaves as geodesics, algorithm for resolving Gronwall's conjecture.
result Resolved Gronwall's conjecture for specific 3-webs.
New instanton homology for webs counts Tait colorings.
problem Counting Tait colorings of complex webs.
method Introducing a local system of coefficients to deform instanton homology.
result Rank of deformed instanton homology equals number of Tait colorings.
Position: Considerations for Differentially Private Learning with Large-Scale Public Pretrainingcs.LG
Publicly pretraining models on Web data may undermine differential privacy.
problem The use of large Web-scraped datasets in differential privacy models.
method Critical review of leveraging pretrained models on public datasets for differential privacy.
result Publicizing pretrained models as 'private' could harm trust and generalize poorly.
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.
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.
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.
Defines generic singularities in planar flat 3-webs and classifies them.
problem Classifying singularities in planar flat 3-webs.
method Proposes a definition of genericity and classifies singularities.
result Classifies generic singularities of planar flat 3-webs.
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.
We study natural bases for two constructions of the irreducible representation of the symmetric group corresponding to : the {\em reduced web} basis associated to Kuperberg's combinatorial description of the spider category; and the {\em left cell basis} for the left cell construction of Kazhdan and Lusztig. I…
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…
TableQnA answers web queries about lists and superlatives from HTML tables.
problem Answer web queries about lists and superlatives from HTML tables.
method Extract intent from queries, use structure-aware matching, and train models with automatic data generation.
result Significantly higher precision and coverage for list and superlative queries.
A 3-web is linearizable, resolving a controversy.
problem Determining the correct linearizability condition for 3-webs.
method A short proof by J.-P. Dufour.
result The 3-web W is linearizable.
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…
Machine learning detects survey validity from user behavior.
problem Detecting valid responses in web surveys.
method Uses mouse activity and machine learning models (LSTM, HMM).
result Predicts survey validity without analyzing specific answers.
Local classification of quasilinear systems with linearizable characteristic webs.
problem Classifying quasilinear systems with linearizable characteristic webs.
method Reciprocal transformations to uncoupled Hopf equations.
result Every quasilinear system with n>3 components can be transformed to n uncoupled Hopf equations.
CCAligned creates a massive web document dataset for cross-lingual research.
problem Identifying comparable documents across different languages.
method Using URL signals to label web documents and mining Common Crawl corpus.
result Release of a dataset with over 392 million URL pairs from 8144 language pairs.
Geodesic flows with specific integrals are linked to special 4-webs.
problem Characterizing geodesic flows with commuting quadratic integrals.
method Characterization through geodesic 4-webs and geometric hypothesis.
result Metrics of Stäckel type for geodesic flows with specific integrals.
Extracts high-quality monolingual datasets from web crawl data.
problem Improving text representation quality through larger corpora.
method Automated pipeline using deduplication and language identification, augmented with filtering for high-quality documents.
result Extracted massive high-quality monolingual datasets from Common Crawl.
Geometrically interprets integrability of geodesic flow using web theory.
problem Integrability of geodesic flow by quadratic integrals.
method Geometric interpretation through web theory and integrable billiards construction.
result Constructs integrable billiards on surfaces with quadratic geodesic integrals.
The Gronwall conjecture states that a planar 3-web of foliations which admits more than one distinct linearizations is locally equivalent to an algebraic web. We propose an analogue of the Gronwall conjecture for the 3-web of foliations by Legendrian curves in a contact three manifold. The Legendrian Gronwall conjectur…