Publications Search
David Jensen, Jennifer Neville
Data mining in social networks Book
na, 2003.
Abstract | Links | BibTeX | Tags:
@book{jensen2003data,
title = {Data mining in social networks},
author = {David Jensen and Jennifer Neville},
url = {https://scholarworks.umass.edu/cgi/viewcontent.cgi?article=1069&context=cs_faculty_pubs},
year = {2003},
date = {2003-01-01},
publisher = {na},
abstract = {Several techniques for learning statistical models have been developed recently by researchers in machine learning and data mining. All of these techniques must address a similar set of representational and algorithmic choices and must face a set of statistical challenges unique to learning from relational data.},
keywords = {},
pubstate = {published},
tppubtype = {book}
}
Several techniques for learning statistical models have been developed recently by researchers in machine learning and data mining. All of these techniques must address a similar set of representational and algorithmic choices and must face a set of statistical challenges unique to learning from relational data.
Amy McGovern, Lisa Friedland, Michael Hay, Brian Gallagher, Andrew Fast, Jennifer Neville, David Jensen
Exploiting relational structure to understand publication patterns in high-energy physics Journal Article
In: SIGKDD Explor., vol. 5, no. 2, pp. 165–172, 2003.
Abstract | Links | BibTeX | Tags:
@article{DBLP:journals/sigkdd/McGovernFHGFNJ03,
title = {Exploiting relational structure to understand publication patterns
in high-energy physics},
author = {Amy McGovern and Lisa Friedland and Michael Hay and Brian Gallagher and Andrew Fast and Jennifer Neville and David Jensen},
url = {https://doi.org/10.1145/980972.980999},
doi = {10.1145/980972.980999},
year = {2003},
date = {2003-01-01},
journal = {SIGKDD Explor.},
volume = {5},
number = {2},
pages = {165--172},
abstract = {We analyze publication patterns in theoretical high-energy physics using a relational learning approach. We focus on four related areas: understanding and identifying patterns of citations, examining publication patterns at the author level, predicting whether a paper will be accepted by specific journals, and identifying research communities from the citation patterns and paper text. Each of these analyses contributes to an overall understanding of theoretical high-energy physics.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
We analyze publication patterns in theoretical high-energy physics using a relational learning approach. We focus on four related areas: understanding and identifying patterns of citations, examining publication patterns at the author level, predicting whether a paper will be accepted by specific journals, and identifying research communities from the citation patterns and paper text. Each of these analyses contributes to an overall understanding of theoretical high-energy physics.
Amy McGovern, David Jensen
Identifying Predictive Structures in Relational Data Using Multiple Instance Learning Proceedings Article
In: Machine Learning, Proceedings of the Twentieth International Conference (ICML 2003), August 21-24, 2003, Washington, DC, USA, pp. 528–535, AAAI Press, 2003.
Abstract | Links | BibTeX | Tags:
@inproceedings{DBLP:conf/icml/McGovernJ03,
title = {Identifying Predictive Structures in Relational Data Using Multiple
Instance Learning},
author = {Amy McGovern and David Jensen},
url = {http://www.aaai.org/Library/ICML/2003/icml03-070.php},
year = {2003},
date = {2003-01-01},
booktitle = {Machine Learning, Proceedings of the Twentieth International Conference
(ICML 2003), August 21-24, 2003, Washington, DC, USA},
pages = {528--535},
publisher = {AAAI Press},
abstract = {This paper introduces an approach for identifying predictive structures in relational data using the multiple-instance framework. By a predictive structure, we mean a structure that can explain a given labeling of the data and can predict labels of unseen data. Multiple-instance learning has previously only been applied to flat, or propositional, data and we present a modification to the framework that allows multiple-instance techniques to be used on relational data. We present experimental results using a relational modification of the diverse density method and of a method based on the chi-squared statistic. We demonstrate that multipleinstance learning can be used to identify predictive structures on both a small illustrative data set and the Internet Movie Database. We compare the classification results to a k-nearest neighbor approach.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
This paper introduces an approach for identifying predictive structures in relational data using the multiple-instance framework. By a predictive structure, we mean a structure that can explain a given labeling of the data and can predict labels of unseen data. Multiple-instance learning has previously only been applied to flat, or propositional, data and we present a modification to the framework that allows multiple-instance techniques to be used on relational data. We present experimental results using a relational modification of the diverse density method and of a method based on the chi-squared statistic. We demonstrate that multipleinstance learning can be used to identify predictive structures on both a small illustrative data set and the Internet Movie Database. We compare the classification results to a k-nearest neighbor approach.
David Jensen, Lise Getoor
IJCAI 2003 workshop on learning statistical models from relational data Miscellaneous
2003.
@misc{jensen2003ijcai,
title = {IJCAI 2003 workshop on learning statistical models from relational data},
author = {David Jensen and Lise Getoor},
url = {https://scholarworks.umass.edu/cgi/viewcontent.cgi?article=1163&context=cs_faculty_pubs},
year = {2003},
date = {2003-01-01},
keywords = {},
pubstate = {published},
tppubtype = {misc}
}
David Jensen, Matthew Rattigan, Hannah Blau
Information awareness: a prospective technical assessment Proceedings Article
In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 24 - 27, 2003, pp. 378–387, ACM, 2003.
Abstract | Links | BibTeX | Tags:
@inproceedings{DBLP:conf/kdd/JensenRB03,
title = {Information awareness: a prospective technical assessment},
author = {David Jensen and Matthew Rattigan and Hannah Blau},
url = {https://doi.org/10.1145/956750.956794},
doi = {10.1145/956750.956794},
year = {2003},
date = {2003-01-01},
booktitle = {Proceedings of the Ninth ACM SIGKDD International Conference on
Knowledge Discovery and Data Mining, Washington, DC, USA, August 24
- 27, 2003},
pages = {378--387},
publisher = {ACM},
abstract = {Recent proposals to apply data mining systems to problems in law enforcement, national security, and fraud detection have attracted both media attention and technical critiques of their expected accuracy and impact on privacy. Unfortunately, the majority of technical critiques have been based on simplistic assumptions about data, classifiers, inference procedures, and the overall architecture of such systems. We consider these critiques in detail, and we construct a simulation model that more closely matches realistic systems. We show how both the accuracy and privacy impact of a hypothetical system could be substantially improved, and we discuss the necessary and sufficient conditions for this improvement to be achieved. This analysis is neither a defense nor a critique of any particular system concept. Rather, our model suggests alternative technical designs that could mitigate some concerns, but also raises more specific conditions that must be met for such systems to be both accurate and socially desirable.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Recent proposals to apply data mining systems to problems in law enforcement, national security, and fraud detection have attracted both media attention and technical critiques of their expected accuracy and impact on privacy. Unfortunately, the majority of technical critiques have been based on simplistic assumptions about data, classifiers, inference procedures, and the overall architecture of such systems. We consider these critiques in detail, and we construct a simulation model that more closely matches realistic systems. We show how both the accuracy and privacy impact of a hypothetical system could be substantially improved, and we discuss the necessary and sufficient conditions for this improvement to be achieved. This analysis is neither a defense nor a critique of any particular system concept. Rather, our model suggests alternative technical designs that could mitigate some concerns, but also raises more specific conditions that must be met for such systems to be both accurate and socially desirable.
Jennifer Neville, David Jensen, Lisa Friedland, Michael Hay
Learning relational probability trees Proceedings Article
In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 24 - 27, 2003, pp. 625–630, ACM, 2003.
Abstract | Links | BibTeX | Tags: Statistical Relational Learning
@inproceedings{DBLP:conf/kdd/NevilleJFH03,
title = {Learning relational probability trees},
author = {Jennifer Neville and David Jensen and Lisa Friedland and Michael Hay},
url = {https://doi.org/10.1145/956750.956830},
doi = {10.1145/956750.956830},
year = {2003},
date = {2003-01-01},
booktitle = {Proceedings of the Ninth ACM SIGKDD International Conference on
Knowledge Discovery and Data Mining, Washington, DC, USA, August 24
- 27, 2003},
pages = {625--630},
publisher = {ACM},
abstract = {Classification trees are widely used in the machine learning and data mining communities for modeling propositional data. Recent work has extended this basic paradigm to probability estimation trees. Traditional tree learning algorithms assume that instances in the training data are homogenous and independently distributed. Relational probability trees (RPTs) extend standard probability estimation trees to a relational setting in which data instances are heterogeneous and interdependent. Our algorithm for learning the structure and parameters of an RPT searches over a space of relational features that use aggregation functions (e.g. AVERAGE, MODE, COUNT) to dynamically propositionalize relational data and create binary splits within the RPT. Previous work has identified a number of statistical biases due to characteristics of relational data such as autocorrelation and degree disparity. The RPT algorithm uses a novel form of randomization test to adjust for these biases. On a variety of relational learning tasks, RPTs built using randomization tests are significantly smaller than other models and achieve equivalent, or better, performance.},
keywords = {Statistical Relational Learning},
pubstate = {published},
tppubtype = {inproceedings}
}
Classification trees are widely used in the machine learning and data mining communities for modeling propositional data. Recent work has extended this basic paradigm to probability estimation trees. Traditional tree learning algorithms assume that instances in the training data are homogenous and independently distributed. Relational probability trees (RPTs) extend standard probability estimation trees to a relational setting in which data instances are heterogeneous and interdependent. Our algorithm for learning the structure and parameters of an RPT searches over a space of relational features that use aggregation functions (e.g. AVERAGE, MODE, COUNT) to dynamically propositionalize relational data and create binary splits within the RPT. Previous work has identified a number of statistical biases due to characteristics of relational data such as autocorrelation and degree disparity. The RPT algorithm uses a novel form of randomization test to adjust for these biases. On a variety of relational learning tasks, RPTs built using randomization tests are significantly smaller than other models and achieve equivalent, or better, performance.
David Jensen, Jennifer Neville, Matthew Rattigan
Randomization tests for relational learning Proceedings Article
In: International Joint Conference on Artificial Intelligence (submitted), Citeseer 2003.
Abstract | Links | BibTeX | Tags:
@inproceedings{jensen2003randomization,
title = {Randomization tests for relational learning},
author = {David Jensen and Jennifer Neville and Matthew Rattigan},
url = {https://www.cs.purdue.edu/homes/neville/papers/jensen-et-al-tr0305.pdf},
year = {2003},
date = {2003-01-01},
booktitle = {International Joint Conference on Artificial Intelligence (submitted)},
organization = {Citeseer},
abstract = {Algorithms for relational learning and propositional learning face different statistical challenges. In contrast to propositional learners, relational learners often make statistical inferences about data that exhibit linkage and autocorrelation. Recent work has shown that these characteristics of relational data can bias inferences made by relational learners. In this paper, we develop a novel variant of a known statistical procedure — a randomization test — that produces accurate hypothesis tests for relational data. We show that our procedure produces unbiased inferences in situations where more obvious adaptations of existing randomization tests fail.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Algorithms for relational learning and propositional learning face different statistical challenges. In contrast to propositional learners, relational learners often make statistical inferences about data that exhibit linkage and autocorrelation. Recent work has shown that these characteristics of relational data can bias inferences made by relational learners. In this paper, we develop a novel variant of a known statistical procedure — a randomization test — that produces accurate hypothesis tests for relational data. We show that our procedure produces unbiased inferences in situations where more obvious adaptations of existing randomization tests fail.
Jennifer Neville, David Jensen, Brian Gallagher
Simple Estimators for Relational Bayesian Classifiers Proceedings Article
In: Proceedings of the 3rd IEEE International Conference on Data Mining (ICDM 2003), 19-22 December 2003, Melbourne, Florida, USA, pp. 609–612, IEEE Computer Society, 2003.
Abstract | Links | BibTeX | Tags: Statistical Relational Learning
@inproceedings{DBLP:conf/icdm/NevilleJG03,
title = {Simple Estimators for Relational Bayesian Classifiers},
author = {Jennifer Neville and David Jensen and Brian Gallagher},
url = {https://doi.org/10.1109/ICDM.2003.1250989},
doi = {10.1109/ICDM.2003.1250989},
year = {2003},
date = {2003-01-01},
booktitle = {Proceedings of the 3rd IEEE International Conference on Data Mining
(ICDM 2003), 19-22 December 2003, Melbourne, Florida, USA},
pages = {609--612},
publisher = {IEEE Computer Society},
abstract = {We present the relational Bayesian classifier (RBC), a modification of the simple Bayesian classifier (SBC) for relational data. There exist several Bayesian classifiers that learn predictive models of relational data, but each uses a different estimation technique for modelling heterogeneous sets of attribute values. The effects of data characteristics on estimation have not been explored. We consider four simple estimation techniques and evaluate them on three real-world data sets. The estimator that assumes each multiset value is independently drawn from the same distribution (INDEPVAL) achieves the best empirical results. We examine bias and variance tradeoffs over a range of data sets and show that INDEPVAL's ability to model more multiset information results in lower bias estimates and contributes to its superior performance.},
keywords = {Statistical Relational Learning},
pubstate = {published},
tppubtype = {inproceedings}
}
We present the relational Bayesian classifier (RBC), a modification of the simple Bayesian classifier (SBC) for relational data. There exist several Bayesian classifiers that learn predictive models of relational data, but each uses a different estimation technique for modelling heterogeneous sets of attribute values. The effects of data characteristics on estimation have not been explored. We consider four simple estimation techniques and evaluate them on three real-world data sets. The estimator that assumes each multiset value is independently drawn from the same distribution (INDEPVAL) achieves the best empirical results. We examine bias and variance tradeoffs over a range of data sets and show that INDEPVAL's ability to model more multiset information results in lower bias estimates and contributes to its superior performance.
Jennifer Neville, Matthew Rattigan, David Jensen
Statistical relational learning: Four claims and a survey Proceedings Article
In: Workshop SRL, Int. Joint. Conf. on AI, 2003.
Abstract | Links | BibTeX | Tags:
@inproceedings{neville2003statistical,
title = {Statistical relational learning: Four claims and a survey},
author = {Jennifer Neville and Matthew Rattigan and David Jensen},
url = {https://www.cs.purdue.edu/homes/neville/papers/neville-et-al-srl2003.pdf},
year = {2003},
date = {2003-01-01},
booktitle = {Workshop SRL, Int. Joint. Conf. on AI},
abstract = {Statistical relational learning (SRL) research has made significant progress over the last 5 years. We have successfully demonstrated the feasibility of a number of probabilistic models for relational data, including probabilistic relational models, Bayesian logic programs, and relational probability trees, and the interest in SRL is growing. However, in order to sustain and nurture the growth of SRL as a subfield we need to refocus our efforts on the science of machine learning — moving from demonstrations to comparative and ablation studies. We will outline four assertions that are implicit to SRL research but which have been only minimally evaluated. We hope to stimulate discussion as to how, as a community, these claims can be addressed in future research.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Statistical relational learning (SRL) research has made significant progress over the last 5 years. We have successfully demonstrated the feasibility of a number of probabilistic models for relational data, including probabilistic relational models, Bayesian logic programs, and relational probability trees, and the interest in SRL is growing. However, in order to sustain and nurture the growth of SRL as a subfield we need to refocus our efforts on the science of machine learning — moving from demonstrations to comparative and ablation studies. We will outline four assertions that are implicit to SRL research but which have been only minimally evaluated. We hope to stimulate discussion as to how, as a community, these claims can be addressed in future research.
Hannah Blau, Neil Immerman, David Jensen
A visual language for querying and updating graphs Journal Article
In: University of Massachusetts Amherst Computer Science Technical Report, vol. 37, pp. 2002, 2002.
Abstract | Links | BibTeX | Tags:
@article{blau2002visual,
title = {A visual language for querying and updating graphs},
author = {Hannah Blau and Neil Immerman and David Jensen},
url = {https://kdl.cs.umass.edu/papers/blau-et-al-tr0237.pdf},
year = {2002},
date = {2002-01-01},
journal = {University of Massachusetts Amherst Computer Science Technical Report},
volume = {37},
pages = {2002},
publisher = {Citeseer},
abstract = {QGRAPH is a new visual language for querying and updating graph databases. In QGRAPH the user can draw a query consisting of some vertices and edges with specified relations between their attributes. The response will be the collection of all subgraphs of the database that have the desired pattern. QGRAPH is very useful for knowledge discovery. QGRAPH has a powerful and elegant counting feature that enables the user to easily specify how many of certain objects and links should exist in order for a subgraph to match a query. QGRAPH has a clean formal semantics which we describe in detail. We show that QGRAPH has expressive power corresponding to a well-defined subset of FO(COUNT), i.e., first-order logic with counting quantifiers.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
QGRAPH is a new visual language for querying and updating graph databases. In QGRAPH the user can draw a query consisting of some vertices and edges with specified relations between their attributes. The response will be the collection of all subgraphs of the database that have the desired pattern. QGRAPH is very useful for knowledge discovery. QGRAPH has a powerful and elegant counting feature that enables the user to easily specify how many of certain objects and links should exist in order for a subgraph to match a query. QGRAPH has a clean formal semantics which we describe in detail. We show that QGRAPH has expressive power corresponding to a well-defined subset of FO(COUNT), i.e., first-order logic with counting quantifiers.
David Jensen, Jennifer Neville
Autocorrelation and Linkage Cause Bias in Evaluation of Relational Learners Proceedings Article
In: Inductive Logic Programming, 12th International Conference, ILP 2002, Sydney, Australia, July 9-11, 2002. Revised Papers, pp. 101–116, Springer, 2002.
Abstract | Links | BibTeX | Tags:
@inproceedings{DBLP:conf/ilp/JensenN02,
title = {Autocorrelation and Linkage Cause Bias in Evaluation of Relational
Learners},
author = {David Jensen and Jennifer Neville},
url = {https://doi.org/10.1007/3-540-36468-4_7},
doi = {10.1007/3-540-36468-4_7},
year = {2002},
date = {2002-01-01},
booktitle = {Inductive Logic Programming, 12th International Conference, ILP
2002, Sydney, Australia, July 9-11, 2002. Revised Papers},
volume = {2583},
pages = {101--116},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
abstract = {Two common characteristics of relational data sets -- concentrated linkage and relational auto-correlation -- can cause traditional methods of evaluation to greatly overestimate the accuracy of induced models on test sets. We identify these characteristics, define quantitative measures of their severity, and explain how they produce this bias. We show how linkage and autocorrelation affect estimates of model accuracy by applying FOIL to synthetic data and to data drawn from the Internet Movie Database. We show how a modified sampling procedure can eliminate the bias.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Two common characteristics of relational data sets -- concentrated linkage and relational auto-correlation -- can cause traditional methods of evaluation to greatly overestimate the accuracy of induced models on test sets. We identify these characteristics, define quantitative measures of their severity, and explain how they produce this bias. We show how linkage and autocorrelation affect estimates of model accuracy by applying FOIL to synthetic data and to data drawn from the Internet Movie Database. We show how a modified sampling procedure can eliminate the bias.
David Jensen, Jennifer Neville
Data mining in networks Proceedings Article
In: Symposium on Dynamic Social Network Modelling and Analysis, National Academy of Sciences. National Academy Press, Washington, 2002.
BibTeX | Tags:
@inproceedings{jensen2002data,
title = {Data mining in networks},
author = {David Jensen and Jennifer Neville},
year = {2002},
date = {2002-01-01},
booktitle = {Symposium on Dynamic Social Network Modelling and Analysis, National Academy of Sciences. National Academy Press, Washington},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
David Jensen
Knowledge evaluation: Statistical evaluations Book Section
In: Handbook of data mining and knowledge discovery, pp. 475–489, 2002.
Abstract | Links | BibTeX | Tags:
@incollection{jensen2002knowledge,
title = {Knowledge evaluation: Statistical evaluations},
author = {David Jensen},
url = {https://dl.acm.org/doi/abs/10.5555/778212.778284},
year = {2002},
date = {2002-01-01},
booktitle = {Handbook of data mining and knowledge discovery},
pages = {475--489},
abstract = {This article introduces basic features of error estimators, including bias, variance, and loss functions. It outlines the logic behind classical hypothesis tests and explains the special challenges faced by knowledge discovery algorithms that search large model spaces. It discusses the statistical effects of multiple comparison procedures (MCPs), and several methods to adjust for those effects, including mathematical adjustments, cross-validation, and randomization tests. Finally, it outlines the basic concepts behind overfitting reduction and pruning.},
keywords = {},
pubstate = {published},
tppubtype = {incollection}
}
This article introduces basic features of error estimators, including bias, variance, and loss functions. It outlines the logic behind classical hypothesis tests and explains the special challenges faced by knowledge discovery algorithms that search large model spaces. It discusses the statistical effects of multiple comparison procedures (MCPs), and several methods to adjust for those effects, including mathematical adjustments, cross-validation, and randomization tests. Finally, it outlines the basic concepts behind overfitting reduction and pruning.
David Jensen, Jennifer Neville
Linkage and Autocorrelation Cause Feature Selection Bias in Relational Learning Proceedings Article
In: Machine Learning, Proceedings of the Nineteenth International Conference (ICML 2002), University of New South Wales, Sydney, Australia, July 8-12, 2002, pp. 259–266, Morgan Kaufmann, 2002.
@inproceedings{DBLP:conf/icml/JensenN02,
title = {Linkage and Autocorrelation Cause Feature Selection Bias in Relational
Learning},
author = {David Jensen and Jennifer Neville},
year = {2002},
date = {2002-01-01},
booktitle = {Machine Learning, Proceedings of the Nineteenth International Conference
(ICML 2002), University of New South Wales, Sydney, Australia, July
8-12, 2002},
pages = {259--266},
publisher = {Morgan Kaufmann},
abstract = {Two common characteristics of relational data sets — concentrated linkage and relational autocorrelation — can cause learning algorithms to be strongly biased toward certain features, irrespective of their predictive power. We identify these characteristics, define quantitative measures of their severity, and explain how they produce this bias. We show how linkage and autocorrelation affect a representative algorithm for feature selection by applying the algorithm to synthetic data and to data drawn from the Internet Movie Database.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Two common characteristics of relational data sets — concentrated linkage and relational autocorrelation — can cause learning algorithms to be strongly biased toward certain features, irrespective of their predictive power. We identify these characteristics, define quantitative measures of their severity, and explain how they produce this bias. We show how linkage and autocorrelation affect a representative algorithm for feature selection by applying the algorithm to synthetic data and to data drawn from the Internet Movie Database.
David Jensen, Jennifer Neville
Schemas and models Proceedings Article
In: Proceedings of the Multi-Relational Data Mining Workshop, 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Citeseer 2002.
Abstract | Links | BibTeX | Tags:
@inproceedings{jensen2002schemas,
title = {Schemas and models},
author = {David Jensen and Jennifer Neville},
url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.3.9704&rep=rep1&type=pdf},
year = {2002},
date = {2002-01-01},
booktitle = {Proceedings of the Multi-Relational Data Mining Workshop, 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining},
organization = {Citeseer},
abstract = {We propose the Schema-Model Framework, which characterizes algorithms that learn probabilistic models from relational data as having two parts: a schema that identifies sets of related data items and groups them into relevant categories; and a model that allows probabilistic inference about those data items. The framework highlights how relational learning techniques must structure their own learning tasks in ways that propositional learners do not. The framework also highlights interesting directions for future research in relational learning.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
We propose the Schema-Model Framework, which characterizes algorithms that learn probabilistic models from relational data as having two parts: a schema that identifies sets of related data items and groups them into relevant categories; and a model that allows probabilistic inference about those data items. The framework highlights how relational learning techniques must structure their own learning tasks in ways that propositional learners do not. The framework also highlights interesting directions for future research in relational learning.
David Jensen, Victor Lesser
Social pathologies of adaptive agents Proceedings Article
In: Safe Learning Agents: Papers from the 2002 AAAI Spring Symposium, pp. 13–19, AAAI Press Menlo Park, CA 2002.
Abstract | Links | BibTeX | Tags:
@inproceedings{jensen2002social,
title = {Social pathologies of adaptive agents},
author = {David Jensen and Victor Lesser},
url = {https://www.aaai.org/Papers/Symposia/Spring/2002/SS-02-07/SS02-07-003.pdf},
year = {2002},
date = {2002-01-01},
booktitle = {Safe Learning Agents: Papers from the 2002 AAAI Spring Symposium},
pages = {13--19},
organization = {AAAI Press Menlo Park, CA},
abstract = {We describe, briefly characterize, and give examples of social pathologies of multiagent systems. Social pathologies are system behaviors in which two or more agents interact such that improvements in local performance do not improve system performance. They are widely observed in both natural and artificial systems.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
We describe, briefly characterize, and give examples of social pathologies of multiagent systems. Social pathologies are system behaviors in which two or more agents interact such that improvements in local performance do not improve system performance. They are widely observed in both natural and artificial systems.
Jennifer Neville, David Jensen
Supporting relational knowledge discovery: Lessons in architecture and algorithm design Proceedings Article
In: Proceedings of the Data Mining Lessons Learned Workshop, 19th International Conference on Machine Learning, 2002.
Abstract | Links | BibTeX | Tags:
@inproceedings{neville2002supporting,
title = {Supporting relational knowledge discovery: Lessons in architecture and algorithm design},
author = {Jennifer Neville and David Jensen},
url = {https://www.researchgate.net/publication/228425396_Supporting_relational_knowledge_discovery_Lessons_in_architecture_and_algorithm_design},
year = {2002},
date = {2002-01-01},
booktitle = {Proceedings of the Data Mining Lessons Learned Workshop, 19th International Conference on Machine Learning},
abstract = {This paper discusses a few of the lessons we have learned developing a relational knowledge discovery system. The relationships among data instances in relational data provide extra infor-mation for "mining." This additional information has the potential to greatly improve the quality of learned models. However, the dependencies among instances in the data also introduce new statistical challenges for learning algorithms. Re-lational data provide an ideal environment in which to examine a central challenge of knowl-edge discovery – its "chicken and egg" character. Data representation can impair the ability to learn important knowledge, but knowing the "right" data representation often requires just that knowledge. With relational data, representa-tion is often a choice; many alternate views of the data provide abundant fodder for reasoning about transformations. In light of this, we discuss representation and design choices that support a co-evolutionary process of knowledge discovery and data transformation in relation data.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
This paper discusses a few of the lessons we have learned developing a relational knowledge discovery system. The relationships among data instances in relational data provide extra infor-mation for "mining." This additional information has the potential to greatly improve the quality of learned models. However, the dependencies among instances in the data also introduce new statistical challenges for learning algorithms. Re-lational data provide an ideal environment in which to examine a central challenge of knowl-edge discovery – its "chicken and egg" character. Data representation can impair the ability to learn important knowledge, but knowing the "right" data representation often requires just that knowledge. With relational data, representa-tion is often a choice; many alternate views of the data provide abundant fodder for reasoning about transformations. In light of this, we discuss representation and design choices that support a co-evolutionary process of knowledge discovery and data transformation in relation data.
Hannah Blau, Neil Immerman, David Jensen
A Visual Query Language for Relational Knowledge Discovery Miscellaneous
2001.
Abstract | Links | BibTeX | Tags:
@misc{blau2001visual,
title = {A Visual Query Language for Relational Knowledge Discovery},
author = {Hannah Blau and Neil Immerman and David Jensen},
url = {https://scholarworks.umass.edu/cgi/viewcontent.cgi?article=1104&context=cs_faculty_pubs},
year = {2001},
date = {2001-01-01},
publisher = {University of Massachusetts},
abstract = {QGRAPH is a visual query language for knowledge discovery in relational data. Using QGRAPH, a user can query and update relational data in ways that support data exploration, data transformation, and sampling. When combined with modeling algorithms, such as those developed in inductive logic programming and relational learning, the language assists analysis of relational data, such as data drawn from the Web, chemical structure-activity relationships, and social networks. Several features distinguish QGRAPH from other query languages such as SQL and Datalog. It is a visual language, so its queries are annotated graphs that reflect potential structures within a database. QGRAPH treats objects, links, and attributes as first-class entities, so its queries can dynamically alter a data schema by adding and deleting those entities. Finally, the language provides grouping and counting constructs that facilitate calculation of attributes that can capture features of local graph structure. We describe the language in detail, discuss key aspects of the underlying data model and implementation, and discuss several uses of QGRAPH for knowledge discovery.},
keywords = {},
pubstate = {published},
tppubtype = {misc}
}
QGRAPH is a visual query language for knowledge discovery in relational data. Using QGRAPH, a user can query and update relational data in ways that support data exploration, data transformation, and sampling. When combined with modeling algorithms, such as those developed in inductive logic programming and relational learning, the language assists analysis of relational data, such as data drawn from the Web, chemical structure-activity relationships, and social networks. Several features distinguish QGRAPH from other query languages such as SQL and Datalog. It is a visual language, so its queries are annotated graphs that reflect potential structures within a database. QGRAPH treats objects, links, and attributes as first-class entities, so its queries can dynamically alter a data schema by adding and deleting those entities. Finally, the language provides grouping and counting constructs that facilitate calculation of attributes that can capture features of local graph structure. We describe the language in detail, discuss key aspects of the underlying data model and implementation, and discuss several uses of QGRAPH for knowledge discovery.
David Jensen, Jennifer Neville
Correlation and sampling in relational data mining Proceedings Article
In: Proceedings of the 33rd Symposium on the Interface of Computing Science and Statistics, 2001.
Abstract | Links | BibTeX | Tags:
@inproceedings{jensen2001correlation,
title = {Correlation and sampling in relational data mining},
author = {David Jensen and Jennifer Neville},
url = {https://www.cs.purdue.edu/homes/neville/papers/jensen-neville-interf2001.pdf},
year = {2001},
date = {2001-01-01},
booktitle = {Proceedings of the 33rd Symposium on the Interface of Computing Science and Statistics},
abstract = {Data mining in relational data poses unique opportunities and challenges. In particular, relational autocorrelation provides an opportunity to increase the predictive power of statistical models, but it can also mislead investigators using traditional sampling approaches to evaluate data mining algorithms. We investigate the problem and provide new sampling approaches that correct the bias associated with traditional sampling.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Data mining in relational data poses unique opportunities and challenges. In particular, relational autocorrelation provides an opportunity to increase the predictive power of statistical models, but it can also mislead investigators using traditional sampling approaches to evaluate data mining algorithms. We investigate the problem and provide new sampling approaches that correct the bias associated with traditional sampling.
Foster Provost, David Jensen, Tim Oates
Progressive sampling Book Section
In: Instance Selection and Construction for Data Mining, pp. 151–170, Springer, Boston, MA, 2001.
@incollection{provost2001progressive,
title = {Progressive sampling},
author = {Foster Provost and David Jensen and Tim Oates},
year = {2001},
date = {2001-01-01},
booktitle = {Instance Selection and Construction for Data Mining},
pages = {151--170},
publisher = {Springer, Boston, MA},
abstract = {Having access to massive amounts of data does not necessarily imply that induction algorithms must use them all. Samples often provide the same accuracy with far less computational cost. However, the correct sample size rarely is obvious. We analyze methods for progressive samplingusing progressively larger samples as long as model accuracy improves. We explore several notions of efficient progressive sampling. We analyze efficiency relative to induction with all instances; we show that a simple, geometric sampling schedule is asymptotically optimal, and we describe how best to take into account prior expectations of accuracy convergence. We then describe the issues involved in instantiating an efficient progressive sampler, including how to detect convergence. Finally, we provide empirical results comparing a variety of progressive sampling methods. We conclude that progressive sampling can be remarkably efficient.},
keywords = {},
pubstate = {published},
tppubtype = {incollection}
}
Having access to massive amounts of data does not necessarily imply that induction algorithms must use them all. Samples often provide the same accuracy with far less computational cost. However, the correct sample size rarely is obvious. We analyze methods for progressive samplingusing progressively larger samples as long as model accuracy improves. We explore several notions of efficient progressive sampling. We analyze efficiency relative to induction with all instances; we show that a simple, geometric sampling schedule is asymptotically optimal, and we describe how best to take into account prior expectations of accuracy convergence. We then describe the issues involved in instantiating an efficient progressive sampler, including how to detect convergence. Finally, we provide empirical results comparing a variety of progressive sampling methods. We conclude that progressive sampling can be remarkably efficient.