Valentine Matcher
Project description
Valentine: (Schema-) Matching DataFrames Made Easy
A python package for capturing potential relationships among columns of different tabular datasets, which are given in the form of pandas DataFrames. Valentine is based on Valentine: Evaluating Matching Techniques for Dataset Discovery
You can find more information about the research supporting Valentine here.
Experimental suite version
The original experimental suite version of Valentine, as first published for the needs of the research paper, can be still found here.
Installation instructions
Requirements
- Python >=3.8,<3.13
- Java: For the Coma matcher it is required to have java (jre) installed
To install Valentine simply run:
pip install valentine
Usage
Valentine can be used to find matches among columns of a given pair of pandas DataFrames.
Matching methods
In order to do so, the user can choose one of the following 5 matching methods:
-
Coma(int: max_n str: strategy)
is a python wrapper around COMA 3.0 Comunity edition- Parameters:
- max_n(int) - Accept similarity threshold, default is 0.
- strategy(str) - Choice of "COMA_OPT" (schema based matching - default) or "COMA_OPT_INST" (schema and instance based matching)
- Parameters:
-
Cupid(float: w_struct, float: leaf_w_struct, float: th_accept)
is the python implementation of the paper Generic Schema Matching with Cupid- Parameters:
- w_struct(float) - Structural similarity threshold, default is 0.2.
- leaf_w_struct(float) - Structural similarity threshold, leaf level, default is 0.2.
- th_accept(float) - Accept similarity threshold, default is 0.7.
- Parameters:
-
DistributionBased(float: threshold1, float: threshold2)
is the python implementation of the paper Automatic Discovery of Attributes in Relational Databases- Parameters:
- threshold1(float) - The threshold for phase 1 of the method, default is 0.15.
- threshold2(float) - The threshold for phase 2 of the method, default is 0.15.
- Parameters:
-
JaccardDistanceMatcher(float: threshold_dist)
is a baseline method that uses Jaccard Similarity between columns to assess their correspondence score, optionally enhanced by a string similarity measure of choice.- Parameters:
-
threshold_dist(float) - Acceptance threshold for assessing two strings as equal, default is 0.8.
-
distance_fun(StringDistanceFunction) - String similarity function used to assess whether two strings are equal. The enumeration class type
StringDistanceFunction
can be imported fromvalentine.algorithms.jaccard_distance
. Functions currently supported are:StringDistanceFunction.Levenshtein
: Levenshtein distanceStringDistanceFunction.DamerauLevenshtein
: Damerau-Levenshtein distanceStringDistanceFunction.Hamming
: Hamming distanceStringDistanceFunction.Jaro
: Jaro distanceStringDistanceFunction.JaroWinkler
: Jaro-Winkler distance *StringDistanceFunction.Exact
: String equality==
-
- Parameters:
-
SimilarityFlooding(str: coeff_policy, str: formula)
is the python implementation of the paper Similarity Flooding: A Versatile Graph Matching Algorithmand its Application to Schema Matching- Parameters:
- coeff_policy(str) - Policy for deciding the weight coefficients of the propagation graph. Choice of "inverse_product" or "inverse_average" (default).
- formula(str) - Formula on which iterative fixpoint computation is based. Choice of "basic", "formula_a", "formula_b" and "formula_c" (default).
- Parameters:
Matching DataFrame Pair
After selecting one of the 5 matching methods, the user can initiate the pairwise matching process in the following way:
matches = valentine_match(df1, df2, matcher, df1_name, df2_name)
where df1 and df2 are the two pandas DataFrames for which we want to find matches and matcher is one of Coma, Cupid, DistributionBased, JaccardLevenMatcher or SimilarityFlooding. The user can also input a name for each DataFrame (defaults are "table_1" and "table_2"). Function valentine_match
returns a dictionary storing as keys column pairs from the two DataFrames and as values the corresponding similarity scores.
Matching DataFrame Batch
After selecting one of the 5 matching methods, the user can initiate the batch matching process in the following way:
matches = valentine_match_batch(df_iter_1, df_iter_2, matcher, df_iter_1_names, df_iter_2_names)
where df_iter_1 and df_iter_2 are the two iterable structures containing pandas DataFrames for which we want to find matches and matcher is one of Coma, Cupid, DistributionBased, JaccardLevenMatcher or SimilarityFlooding. The user can also input an iterable with names for each DataFrame. Function valentine_match_batch
returns a dictionary storing as keys column pairs from the DataFrames and as values the corresponding similarity scores.
Measuring effectiveness
Based on the matches retrieved by calling valentine_match
the user can use
metrics = valentine_metrics.all_metrics(matches, ground_truth)
in order to get all effectiveness metrics, such as Precision, Recall, F1-score and others as described in the original Valentine paper. In order to do so, the user needs to also input the ground truth of matches based on which the metrics will be calculated. The ground truth can be given as a list of tuples representing column matches that should hold.
Example
The following block of code shows: 1) how to run a matcher from Valentine on two DataFrames storing information about authors and their publications, and then 2) how to assess its effectiveness based on a given ground truth (as found in valentine_example.py
):
# Load data using pandas
d1_path = os.path.join('data', 'authors1.csv')
d2_path = os.path.join('data', 'authors2.csv')
df1 = pd.read_csv(d1_path)
df2 = pd.read_csv(d2_path)
# Instantiate matcher and run
matcher = Coma(use_instances=True)
matches = valentine_match(df1, df2, matcher)
print(matches)
# If ground truth available valentine could calculate the metrics
ground_truth = [('Cited by', 'Cited by'),
('Authors', 'Authors'),
('EID', 'EID')]
metrics = valentine_metrics.all_metrics(matches, ground_truth)
print(metrics)
The output of the above code block is:
{(('table_1', 'Cited by'), ('table_2', 'Cited by')): 0.8374313,
(('table_1', 'Authors'), ('table_2', 'Authors')): 0.83498037,
(('table_1', 'EID'), ('table_2', 'EID')): 0.8214057}
{'precision': 1.0, 'recall': 1.0, 'f1_score': 1.0,
'precision_at_10_percent': 1.0,
'precision_at_30_percent': 1.0,
'precision_at_50_percent': 1.0,
'precision_at_70_percent': 1.0,
'precision_at_90_percent': 1.0,
'recall_at_sizeof_ground_truth': 1.0}
Cite Valentine
Original Valentine paper:
@inproceedings{koutras2021valentine,
title={Valentine: Evaluating Matching Techniques for Dataset Discovery},
author={Koutras, Christos and Siachamis, George and Ionescu, Andra and Psarakis, Kyriakos and Brons, Jerry and Fragkoulis, Marios and Lofi, Christoph and Bonifati, Angela and Katsifodimos, Asterios},
booktitle={2021 IEEE 37th International Conference on Data Engineering (ICDE)},
pages={468--479},
year={2021},
organization={IEEE}
}
Demo Paper:
@article{koutras2021demo,
title={Valentine in Action: Matching Tabular Data at Scale},
author={Koutras, Christos and Psarakis, Kyriakos and Siachamis, George and Ionescu, Andra and Fragkoulis, Marios and Bonifati, Angela and Katsifodimos, Asterios},
journal={VLDB},
volume={14},
number={12},
pages={2871--2874},
year={2021},
publisher={VLDB Endowment}
}
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.