text:
@inproceedings{10.1145/2499178.2499202,
author = {Melucci, Massimo and Piwowarski, Benjamin},
title = {Quantum Mechanics and Information Retrieval: From Theory to Application},
year = {2013},
isbn = {9781450321075},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2499178.2499202},
doi = {10.1145/2499178.2499202},
booktitle = {Proceedings of the 2013 Conference on the Theory of Information Retrieval},
pages = {1},
numpages = {1},
keywords = {Vector Space Model, Information Access and Retrieval, Quantum Probability, Interaction, Context},
location = {Copenhagen, Denmark},
series = {ICTIR '13}
}

@inproceedings{10.1145/2499178.2499204,
author = {Carterette, Ben},
title = {Statistical Significance Testing in Information Retrieval: Theory and Practice},
year = {2013},
isbn = {9781450321075},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2499178.2499204},
doi = {10.1145/2499178.2499204},
abstract = {The past 20 years have seen a great improvement in the rigor of information retrieval experimentation, due primarily to two factors: high-quality, public, portable test collections such as those produced by TREC (the Text REtrieval Conference [2]), and the increased practice of statistical hypothesis testing to determine whether measured improvements can be ascribed to something other than random chance. Together these create a very useful standard for reviewers, program committees, and journal editors; work in information retrieval (IR) increasingly cannot be published unless it has been evaluated using a well-constructed test collection and shown to produce a statistically significant improvement over a good baseline.But, as the saying goes, any tool sharp enough to be useful is also sharp enough to be dangerous. Statistical tests of significance are widely misunderstood. Most researchers treat them as a "black box": evaluation results go in and a p-value comes out. Because significance is such an important factor in determining what research directions to explore and what is published, using p-values obtained without thought can have consequences for everyone doing research in IR. Ioannidis has argued that the main consequence in the biomedical sciences is that most published research findings are false [1]; could that be the case in IR as well?},
booktitle = {Proceedings of the 2013 Conference on the Theory of Information Retrieval},
pages = {2},
numpages = {1},
keywords = {information retrieval, statistical significance},
location = {Copenhagen, Denmark},
series = {ICTIR '13}
}

@inproceedings{10.1145/2499178.2499205,
author = {Zhai, ChengXiang and Fang, Hui},
title = {Axiomatic Analysis and Optimization of Information Retrieval Models},
year = {2013},
isbn = {9781450321075},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2499178.2499205},
doi = {10.1145/2499178.2499205},
abstract = {The accuracy of a search engine is mostly determined by the optimality of the retrieval model used in the search engine. Develoing optimal retrieval models has always been a very important fundamental research problem in information retrieval because an improved general retrieval model would enable all search engines to be more useful, thus have immediate broad impact. Extensive research has been done on developing an optimal retrieval model since 1960s, leading to multiple effective retrieval models, including, e.g., Pivoted Normalization Vector Space model, BM25, Dirichlet Prior Query Likelihood, and PL2. However, these state of the art retrieval models were all developed at least a decade ago, suggesting that it has been difficult to further improve them. One reason why we could not easily improve these models is because we do not have a good understanding of their deficiencies and have mostly relied on empirical evaluation to assess the superiority of a retrieval model.Recently, an axiomatic way of analyzing and optimizing retrieval models has been developed and shown great promise in both understanding the deficiencies of retrieval models and developing more effective ones. The basic idea of this axiomatic framework is to specify a number of formal constraints that an optimal retrieval model is expected to satisfy, and use them to assess the optimality of a retrieval model. Such an axiomatic way of modeling relevance provides a theoretical way to study how to develop an ultimately optimal retrieval model, enables analytical comparison of different retrieval models without necessarily requiring empirical evaluation, and has led to the development of multiple more effective retrieval models.The purpose of this tutorial is to systematically explain this emerging axiomatic approach to developing optimal retrieval models, review and summarize the research progress achieved so far on this topic, and discuss promising future research directions in optimizing general retrieval models. Tutorial attendees can expect to learn, among others, (1) the basic methodology of axiomatic analysis and optimization of retrieval models, (2) how to formalize retrieval heuristics with mathematical constraints, (3) the major retrieval constraints proposed so far, (4) the new retrieval functions derived by using the axiomatic approaches, (5) specific research directions to further develop more effective retrieval models, and (6) general open challenges in developing an ultimately optimal retrieval model. The tutorial should appeal to those who work on information retrieval models and those who are interested in applying axiomatic analysis to optimize specific retrieval functions in real applications. The tutorial should also be interesting to researchers who work on ranking problems in general. Attendees will be assumed to know the basic concepts in information retrieval models.},
booktitle = {Proceedings of the 2013 Conference on the Theory of Information Retrieval},
pages = {3},
numpages = {1},
keywords = {axiomatic analysis, retrieval constraints, retrieval models, retrieval heuristics, optimization},
location = {Copenhagen, Denmark},
series = {ICTIR '13}
}

@inproceedings{10.1145/2499178.2499203,
author = {Roelleke, Thomas},
title = {IR Models: Foundations and Relationships},
year = {2013},
isbn = {9781450321075},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2499178.2499203},
doi = {10.1145/2499178.2499203},
abstract = {IR models form a core part of IR research. This tutorial consolidates the foundations of IR models, and highlights relationships that help to better understand IR models. The first part of the tutorial reviews the state-of-the-art, and the second part shows insights into the relationships between TF-IDF, the Probability of Relevance Framework (PRF), BM25, language modelling (LM), probabilistic inference networks (PIN's), and Divergence-from-Randomness (DFR).},
booktitle = {Proceedings of the 2013 Conference on the Theory of Information Retrieval},
pages = {4},
numpages = {1},
location = {Copenhagen, Denmark},
series = {ICTIR '13}
}

@inproceedings{10.1145/2499178.2499488,
author = {Baeza-Yates, Ricardo},
title = {Is There Space for Theory in Modern Commercial Search Engines?},
year = {2013},
isbn = {9781450321075},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2499178.2499488},
doi = {10.1145/2499178.2499488},
abstract = {In this invited talk we strip current Web search engines to enumerate the main problems where theory may be still useful for improving the quality and performance of them. The problems cover all the main processes involved in a search engine: crawling, indexing, searching, and ranking. We also explore problems related to the user experience where theory may also be relevant.},
booktitle = {Proceedings of the 2013 Conference on the Theory of Information Retrieval},
pages = {5},
numpages = {1},
keywords = {indexing, ranking, searching, Crawling},
location = {Copenhagen, Denmark},
series = {ICTIR '13}
}

@inproceedings{10.1145/2499178.2499179,
author = {Clinchant, St\'{e}phane and Gaussier, Eric},
title = {A Theoretical Analysis of Pseudo-Relevance Feedback Models},
year = {2013},
isbn = {9781450321075},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2499178.2499179},
doi = {10.1145/2499178.2499179},
abstract = {Our goal in this study is to compare several widely used pseudo-relevance feedback (PRF) models and understand what explains their respective behavior. To do so, we first analyze how different PRF models behave through the characteristics of the terms they select and through their performance on two widely used test collections. This analysis reveals that several well-known models surprisingly tend to select very common terms, with low IDF (inverse document frequency). We then introduce several conditions PRF models should satisfy regarding both the terms they select and the way they weigh them, prior to study whether standard PRF models satisfy these conditions or not. This study reveals that most models are deficient with respect to at least one condition, and that this deficiency explains the results of our analysis of the behavior of the models, as well as some of the results reported on the respective performance of PRF models. Based on the PRF conditions, we finally propose possible corrections for the simple mixture model. The PRF models obtained after these corrections outperform their standard version and yield state-of-the-art PRF models which confirms the validity of our theoretical analysis.},
booktitle = {Proceedings of the 2013 Conference on the Theory of Information Retrieval},
pages = {6–13},
numpages = {8},
keywords = {Pseudo Relevance Feedback, Axiomatic Theory, IR Theory},
location = {Copenhagen, Denmark},
series = {ICTIR '13}
}

@inproceedings{10.1145/2499178.2499201,
author = {Butman, Olga and Shtok, Anna and Kurland, Oren and Carmel, David},
title = {Query-Performance Prediction Using Minimal Relevance Feedback},
year = {2013},
isbn = {9781450321075},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2499178.2499201},
doi = {10.1145/2499178.2499201},
abstract = {There has been much work on devising query-performance prediction approaches that estimate search effectiveness without relevance judgments (i.e., zero feedback). Specifically, post-retrieval predictors analyze the result list of top-retrieved documents. Departing from the zero-feedback approach, in this paper we show that relevance feedback for even very few top ranked documents can be exploited to dramatically improve prediction quality. Specifically, applying state-of-the-art zero-feedback-based predictors to only a very few relevant documents, rather than to the entire result list as originally designed, substantially improves prediction quality. This novel form of prediction is based on quantifying properties of relevant documents that can attest to query performance. We also show that integrating prediction based on relevant documents with zero-feedback-based prediction is highly effective; specifically, with respect to utilizing state-of-the-art direct estimates of retrieval effectiveness when minimal feedback is available.},
booktitle = {Proceedings of the 2013 Conference on the Theory of Information Retrieval},
pages = {14–21},
numpages = {8},
keywords = {query-performance prediction},
location = {Copenhagen, Denmark},
series = {ICTIR '13}
}

@inproceedings{10.1145/2499178.2499182,
author = {Busin, Luca and Mizzaro, Stefano},
title = {Axiometrics: An Axiomatic Approach to Information Retrieval Effectiveness Metrics},
year = {2013},
isbn = {9781450321075},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2499178.2499182},
doi = {10.1145/2499178.2499182},
abstract = {The evaluation of retrieval effectiveness has played and is playing a central role in Information Retrieval (IR). A specific issue is that there are literally dozens (most likely more than one hundred) IR effectiveness metrics, and counting.In this paper we propose an axiomatic approach to IR effectiveness metrics. We build on the notions of measure, measurement, and similarity; they allow us to provide a general definition of IR effectiveness metric. On this basis, we then propose and justify some axioms that every effectiveness metric should satisfy, and we derive some theorems from the axioms. We also discuss some future developments.},
booktitle = {Proceedings of the 2013 Conference on the Theory of Information Retrieval},
pages = {22–29},
numpages = {8},
keywords = {formal properties, Effectiveness metrics},
location = {Copenhagen, Denmark},
series = {ICTIR '13}
}

@inproceedings{10.1145/2499178.2499184,
author = {Berto, Andrea and Mizzaro, Stefano and Robertson, Stephen},
title = {On Using Fewer Topics in Information Retrieval Evaluations},
year = {2013},
isbn = {9781450321075},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2499178.2499184},
doi = {10.1145/2499178.2499184},
abstract = {The possibility of using fewer topics in TREC, and in TREC-like initiatives, has been studied recently, with encouraging results: even when decreasing consistently the number of topics (for example, using a topic subset of cardinality only 10, in place of the usual 50) it is possible, at least potentially, to obtain similar results when evaluating system effectiveness. However, the generality of this approach has been questioned, since the topic subset selected on one system population does not seem adequate to evaluate other systems. In this paper we reconsider that generality issue: we emphasize some limitations in the previous work and we show some experimental results that are instead more positive. The obtained results support the hypothesis that, by taking special care, the few topics selected on the basis of a given system population are also adequate to evaluate a different system population as well.},
booktitle = {Proceedings of the 2013 Conference on the Theory of Information Retrieval},
pages = {30–37},
numpages = {8},
keywords = {IR evaluation, TREC, test collection},
location = {Copenhagen, Denmark},
series = {ICTIR '13}
}

@inproceedings{10.1145/2499178.2502080,
author = {Ingwersen, Peter},
title = {IR Research: Challenges and Long-Range Opportunities},
year = {2013},
isbn = {9781450321075},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2499178.2502080},
doi = {10.1145/2499178.2502080},
abstract = {The field of Information Retrieval (IR) is under steady development and change. Information collections have become larger and more diversified; elaborated IT platforms penetrate most life situations; computers have become more powerful; networks and devices more widespread; social media and information interaction in many forms are increasingly used in daily life, etc. Simultaneously, the information experiences of users and use of information has become increasingly differentiated. IR is well-integrated into all kinds of mobile, transactional and traditional information systems dealing with most kinds of media.Since 2002 several workshops have been held to discuss the future lines of action in IR research and development - the so-called SWIRL workshops. For an update of results see SIGIR Forum vol. 46 (1), 2012, p. 2-32. During the last SWIRL the following issues were discussed: Not just ranked lists; Help for users; Capturing context; Information - not documents; Domains (novel non-textual IT-driven areas of IR research); Evaluation.Since ICTIR 2013 fundamentally concerns IR theory the objectives of the ICTIR 2013 panel are to pinpoint central theoretical short and long-term pathways, challenges, opportunities and consequences for IR research. The following themes are suggested but not limited to be approached during the panel from predominantly theoretical perspectives:1. How far can we push ranking models, such as language models, quantum, or learning to rank - and to what end?2. Information interaction, user experiences, context and relevance - where do we stand - what is amiss?3. Personalization issues - should user models be socially constructed or real-time dependent?4. Social media in integration - useful to IR?5. Non-textual media - which models are scientifically sound?6. Small and medium-sized integrated collections - enterprise IR: where do we stand?7. Evaluation and metrics - theory-driven or ad-hoc?Some of the themes can be combined in response to the questions, for instance, evaluation methodologies for integrated information systems, and sub-themes can be evoked, e.g. tasks, authority or importance vs. relevance and relevance feedback for information interaction. Remember that IR theory is not just a mathematical-logical enterprise but includes conceptual models, frameworks and perspectives as well.},
booktitle = {Proceedings of the 2013 Conference on the Theory of Information Retrieval},
pages = {38},
numpages = {1},
keywords = {information retrieval theory, foundations},
location = {Copenhagen, Denmark},
series = {ICTIR '13}
}

@inproceedings{10.1145/2499178.2499489,
author = {Widdows, Dominic},
title = {Compositional Vector Semantics Over Different Ground Fields},
year = {2013},
isbn = {9781450321075},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2499178.2499489},
doi = {10.1145/2499178.2499489},
abstract = {For many years, vector space models have been used in information retrieval and computational linguistics to represent terms, queries, and documents, using vector addition as a simple operator to model semantic composition. Though surprisingly successful, many aspects of meaning including word order, typed relationships, and nested structures are not captured by this modelling process.In recent years, this has changed dramatically. Several researchers have had considerable success at representing other semantic operations in vector models, including negation, typed relationships, distributed inference, adjective-noun modification, and nested composition. This success is partly due to the ready availability of established algebraic methods including orthogonal projection, tensor algebra and matrix multiplication, circular convolution, and permutation.When applied to vectors with complex or binary numbers as coordinates, these operations, their implementations, and experimental results sometimes differ markedly from those obtained with real numbers as coordinates. This brings our attention to a surprising gap in information retrieval and indeed machine learning: in these rapidly developing empirical fields, we tend to tacitly assume that real numbers are the canonical ground field. This is in marked contrast to physics, where complex numbers are ubiquitous, and logic, where binary numbers are the established starting point.In this talk, we will review some of the algebraic operators used today for modelling composition of meaning with vectors, and compare their implementations and behaviours when using different number fields for the vector coordinates. The main goal is to encourage theoretical and practical researchers in information retrieval to experiment much more with complex and binary vectors as well as real vectors, in the hope that such investigations may prove as fruitful for information retrieval as they have been for physics and logic.},
booktitle = {Proceedings of the 2013 Conference on the Theory of Information Retrieval},
pages = {39},
numpages = {1},
keywords = {foundations, information retrieval theory},
location = {Copenhagen, Denmark},
series = {ICTIR '13}
}

@inproceedings{10.1145/2499178.2499188,
author = {Li, Wei and Jones, Gareth G.F.},
title = {Enhanced Information Retrieval by Exploiting Recommender Techniques in Cluster-Based Link Analysis},
year = {2013},
isbn = {9781450321075},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2499178.2499188},
doi = {10.1145/2499178.2499188},
abstract = {Inspired by the use of PageRank algorithms in document ranking, we develop and evaluate a cluster-based PageRank algorithm to re-rank information retrieval (IR) output with the objective of improving ad hoc search effectiveness. Unlike existing work, our methods exploit recommender techniques to extract the correlation between documents and apply detected correlations in a cluster-based PageRank algorithm to compute the importance of each document in a dataset. In this study two popular recommender techniques are examined in four proposed PageRank models to investigate the effectiveness of our approach. Comparison of our methods with strong baselines demonstrates the solid performance of our approach. Experimental results are reported on an extended version of the FIRE 2011 personal information retrieval (PIR) data collection which includes topically related queries with click-through data and relevance assessment data collected from the query creators. The search logs of the query creators are categorized based on their different topical interests. The experimental results show the significant improvement of our approach compared to results using standard IR and cluster-based PageRank methods.},
booktitle = {Proceedings of the 2013 Conference on the Theory of Information Retrieval},
pages = {40–47},
numpages = {8},
keywords = {Markov random model, Information retrieval, recommender techniques, re-ranking, cluster-based PageRank model},
location = {Copenhagen, Denmark},
series = {ICTIR '13}
}

@inproceedings{10.1145/2499178.2499186,
author = {Bellog\'{\i}n, Alejandro and de Vries, Arjen P.},
title = {Understanding Similarity Metrics in Neighbour-Based Recommender Systems},
year = {2013},
isbn = {9781450321075},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2499178.2499186},
doi = {10.1145/2499178.2499186},
abstract = {Neighbour-based collaborative filtering is a recommendation technique that provides meaningful and, usually, accurate recommendations. The method's success depends however critically upon the similarity metric used to find the most similar users (neighbours), the basis of the predictions made. In this paper, we explore twelve features that aim to explain why some user similarity metrics perform better than others. Specifically, we define two sets of features, a first one based on statistics computed over the distance distribution in the neighbourhood, and, a second one based on the nearest neighbour graph. Our experiments with a public dataset show that some of these features are able to correlate with the performance up to a 90%.},
booktitle = {Proceedings of the 2013 Conference on the Theory of Information Retrieval},
pages = {48–55},
numpages = {8},
keywords = {Collaborative Filtering, Similarity metric, Neighbour selection},
location = {Copenhagen, Denmark},
series = {ICTIR '13}
}

@inproceedings{10.1145/2499178.2499195,
author = {Kim, Hyun Duk and Nikitin, Danila and Zhai, ChengXiang and Castellanos, Malu and Hsu, Meichun},
title = {Information Retrieval with Time Series Query},
year = {2013},
isbn = {9781450321075},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2499178.2499195},
doi = {10.1145/2499178.2499195},
abstract = {We study a novel information retrieval problem, where the query is a time series for a given time period, and the retrieval task is to find relevant documents in a text collection of the same time period, which contain topics that are correlated with the query time series. This retrieval problem arises in many text mining applications where there is a need to analyze text data in order to discover potentially causal topics. To solve this problem, we propose and study multiple retrieval algorithms that use the general idea of ranking text documents based on how well their terms are correlated with the query time series. Experiment results show that the proposed retrieval algorithm can effectively help users find documents that are relevant to the time series queries, which can help users analyze the variation patterns of the time series.},
booktitle = {Proceedings of the 2013 Conference on the Theory of Information Retrieval},
pages = {56–63},
numpages = {8},
keywords = {Time Series Query, Text Stream, Information Retrieval},
location = {Copenhagen, Denmark},
series = {ICTIR '13}
}

@dataset{10.1145/review-2499178.2499195_R49850,
author = {Berkovich, Simon},
title = {Review ID:R49850 for DOI: 10.1145/2499178.2499195},
publisher = {Association for Computing Machinery},
url = {https://doi.org/10.1145/review-2499178.2499195_R49850}
}

@inproceedings{10.1145/2499178.2499196,
author = {Pattabiraman, Kumaresh and Sondhi, Parikshit and Zhai, ChengXiang},
title = {Exploiting Forum Thread Structures to Improve Thread Clustering},
year = {2013},
isbn = {9781450321075},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2499178.2499196},
doi = {10.1145/2499178.2499196},
abstract = {Automated clustering of threads within and across web forums will greatly benefit both users and forum administrators in efficiently seeking, managing, and integrating the huge volume of content being generated. While clustering has been studied for other types of data, little work has been done on clustering forum threads; the informal nature and special structure of forum data make it interesting to study how to effectively cluster forum threads. In this paper, we apply three state of the art clustering methods (i.e., hierarchical agglomerative clustering, k-Means, and probabilistic latent semantic analysis) to cluster forum threads and study how to leverage the structure of threads to improve clustering accuracy. We propose three different methods for assigning weights to the posts in a forum thread to achieve more accurate representation of a thread. We evaluate all the methods on data collected from three different Linux forums for both within-forum and across-forum clustering. Our results show that the state of the art methods perform reasonably well for this task, but the performance can be further improved by exploiting thread structures. In particular, a parabolic weighting method that assigns higher weights for both beginning posts and end posts of a thread is shown to consistently outperform a standard clustering method.},
booktitle = {Proceedings of the 2013 Conference on the Theory of Information Retrieval},
pages = {64–71},
numpages = {8},
keywords = {forums, k-Means, thread clustering, web 2.0, text mining},
location = {Copenhagen, Denmark},
series = {ICTIR '13}
}

@inproceedings{10.1145/2499178.2499192,
author = {Wu, Hao and Fang, Hui},
title = {Tie Breaker: A Novel Way of Combining Retrieval Signals},
year = {2013},
isbn = {9781450321075},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2499178.2499192},
doi = {10.1145/2499178.2499192},
abstract = {Empirical studies of information retrieval suggest that the effectiveness of a retrieval function is closely related to how it combines multiple retrieval signals including term frequency, inverse document frequency and document length. Although it is relatively easy to capture how each signal contributes to the relevance scores, it is more challenging to find the best way of combining these signals since they often interact with each other in a complicated way. As a result, when deriving a retrieval function from traditional retrieval models, the choice of one implementation over the others was often made based on empirical observations rather than sound theoretical derivations.In this paper, we propose a novel way of combining retrieval signals to derive robust retrieval functions. Instead of seeking an integrated way of combining these signals into a complex mathematical retrieval function, our main idea is to prioritize the retrieval signals, apply the strongest signal first to rank documents, and then iteratively use the weaker signals to break the ties of the documents with the same scores. One unique advantage of our method is that it eliminates the need of having complicated implementation of the signals and enables a simple yet elegant way of combining the multiple signals for document ranking. Empirical results show that the proposed method can achieve comparable performance as the state of art retrieval functions over traditional TREC ad hoc retrieval collections, and can outperform them over TREC microblog retrieval collections.},
booktitle = {Proceedings of the 2013 Conference on the Theory of Information Retrieval},
pages = {72–75},
numpages = {4},
keywords = {prediction, tie-breaking},
location = {Copenhagen, Denmark},
series = {ICTIR '13}
}

@inproceedings{10.1145/2499178.2499190,
author = {Zheng, Wei and Fang, Hui},
title = {A Diagnostic Study of Search Result Diversification Methods},
year = {2013},
isbn = {9781450321075},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2499178.2499190},
doi = {10.1145/2499178.2499190},
abstract = {Search result diversification aims to maximize the coverage of different pieces of relevant information in the search results. Many diversification methods have been proposed and studied. However, the advantage and disadvantage of each method still remain unclear. In this paper, we conduct a diagnostic study over two state of the art diversification methods with the goal of identifying the weaknesses of these methods to further improve the performance. Specifically, we design a set of perturbation tests that isolate individual factors, i.e., relevance and diversity, which affect the diversification performance. The test results are expected to provide insights on how well each method deals with these factors in the diversification process. Experimental results suggest that some methods perform better in queries whose originally retrieved documents are more relevant to the query while other methods perform better when the documents are more diversified. We therefore propose methods to combine these existing methods based on the predicted factor of the query. The experimental results show that the combined methods can outperform individual methods on TREC collections.},
booktitle = {Proceedings of the 2013 Conference on the Theory of Information Retrieval},
pages = {76–79},
numpages = {4},
keywords = {perturbation, diagnostic, Diversification},
location = {Copenhagen, Denmark},
series = {ICTIR '13}
}

@inproceedings{10.1145/2499178.2499191,
author = {Yang, Peilin and Fang, Hui},
title = {Opinion-Based User Profile Modeling for Contextual Suggestions},
year = {2013},
isbn = {9781450321075},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2499178.2499191},
doi = {10.1145/2499178.2499191},
abstract = {The problem of contextual suggestion is defined as finding suggested places for a user based on the temporal and geographical context of the user as well as the user's preferences on example places. Existing studies models user preferences based on the descriptive information about the suggestions and might not generalize well. In this paper, we propose to model user profiles based on the opinions about the candidate suggestions. Instead of simply building a profile about "what a user likes or dislikes", we want to build the profile based on "why a user likes or dislikes" so that we can make a more accurate prediction on whether a user would like a new candidate suggestion. In particular, we propose to leverage the opinions from the comments posted by other users to estimate a user's profile. The basic assumption is that the reason why a user likes or dislikes a place is likely to be covered by the reviews posted by other users who share the similar opinions as the user. Experiments results over a TREC collection show that the proposed opinion-based user modeling can indeed outperform the existing description-based methods.},
booktitle = {Proceedings of the 2013 Conference on the Theory of Information Retrieval},
pages = {80–83},
numpages = {4},
keywords = {user modeling, opinion, recommendation, contextual suggestions},
location = {Copenhagen, Denmark},
series = {ICTIR '13}
}

@inproceedings{10.1145/2499178.2499490,
author = {van Rijsbergen, Keith},
title = {The Roots of the Theoretical Basis for Information Retrieval},
year = {2013},
isbn = {9781450321075},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2499178.2499490},
doi = {10.1145/2499178.2499490},
abstract = {Over many years a number of theoretical constructs and models have evolved for the study of information retrieval in its various manifestations. Gradually these have settled down into a small number of generally accepted techniques. Some of these are based on logic, probability theory, or vector space theory. In my talk I will go back in time and show how these techniques took shape, and how they were based on some standard theories in formal logic, decision theory, and linear algebra. The struggle to establish these techniques is in itself of interest, especially in relation to the need to deploy a sensible theory of measurement to quantify retrieval effectiveness. In discussing this earlier work I will emphasise the research of some of the early pioneers in our field: Fairthorne, Maron, Cooper, Cleverdon, Salton and Sparck Jones.},
booktitle = {Proceedings of the 2013 Conference on the Theory of Information Retrieval},
pages = {84},
numpages = {1},
keywords = {information retrieval theory, foundations},
location = {Copenhagen, Denmark},
series = {ICTIR '13}
}

@inproceedings{10.1145/2499178.2499181,
author = {Robertson, Stephen and Kanoulas, Evangelos and Yilmaz, Emine},
title = {Modelling Score Distributions Without Actual Scores},
year = {2013},
isbn = {9781450321075},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2499178.2499181},
doi = {10.1145/2499178.2499181},
abstract = {Score-distribution models are used for various practical purposes in search, for example for results merging and threshold setting. In this paper, the basic ideas of the score-distributional approach to viewing and analysing the effectiveness of search systems are re-examined. All recent score-distribution modelling work depends on the availability of actual scores generated by systems, and makes assumptions about these scores. Such work is therefore not applicable to systems which do not generate or reveal such scores, or whose scoring/ranking approach violates the assumptions. We demonstrate that it is possible to apply at least some score-distributional ideas without access to real scores, knowing only the rankings produced (together with a single effectiveness metric based on relevance judgements). This new basic insight is illustrated by means of simulation experiments, on a range of TREC runs, some of whose reported scores are clearly unsuitable for existing methods.},
booktitle = {Proceedings of the 2013 Conference on the Theory of Information Retrieval},
pages = {85–92},
numpages = {8},
keywords = {models, effectiveness, score distributions},
location = {Copenhagen, Denmark},
series = {ICTIR '13}
}

@inproceedings{10.1145/2499178.2499187,
author = {Abdulahhad, Karam and Chevallet, Jean-Pierre and Berrut, Catherine},
title = {Revisiting Exhaustivity and Specificity Using Propositional Logic and Lattice Theory},
year = {2013},
isbn = {9781450321075},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2499178.2499187},
doi = {10.1145/2499178.2499187},
abstract = {Exhaustivity and Specificity in logical Information Retrieval framework were introduced by Nie [16]. However, even with some attempts, they are still theoretical notions without a clear idea of how to be implemented. In this study, we present a new approach to deal with them. We use propositional logic and lattice theory in order to redefine the two implications and their uncertainty P(d → q) and P(q → d). We also show how to integrate the two notions into a concrete IR model for building a new effective model. Our proposal is validated against six corpora, and using two types of terms (words and concepts). The experimental results showed the validity of our viewpoint, which state: the explicit integration of Exhaustivity and Specificity into IR models will improve the retrieval performance of these models. Moreover, there should be a type of balance between the two notions.},
booktitle = {Proceedings of the 2013 Conference on the Theory of Information Retrieval},
pages = {93–100},
numpages = {8},
keywords = {Specificity, Exhaustivity, Information retrieval},
location = {Copenhagen, Denmark},
series = {ICTIR '13}
}

@inproceedings{10.1145/2499178.2499189,
author = {Krstovski, Kriste and Smith, David A. and Wallach, Hanna M. and McGregor, Andrew},
title = {Efficient Nearest-Neighbor Search in the Probability Simplex},
year = {2013},
isbn = {9781450321075},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2499178.2499189},
doi = {10.1145/2499178.2499189},
abstract = {Document similarity tasks arise in many areas of information retrieval and natural language processing. A fundamental question when comparing documents is which representation to use. Topic models, which have served as versatile tools for exploratory data analysis and visualization, represent documents as probability distributions over latent topics. Systems comparing topic distributions thus use measures of probability divergence such as Kullback-Leibler, Jensen-Shannon, or Hellinger. This paper presents novel analysis and applications of the reduction of Hellinger divergence to Euclidean distance computations. This reduction allows us to exploit fast approximate nearest-neighbor (NN) techniques, such as locality-sensitive hashing (LSH) and approximate search in k-d trees, for search in the probability simplex. We demonstrate the effectiveness and efficiency of this approach on two tasks using latent Dirichlet allocation (LDA) document representations: discovering relationships between National Institutes of Health (NIH) grants and prior-art retrieval for patents. Evaluation on these tasks and on synthetic data shows that both Euclidean LSH and approximate k-d tree search perform well when a single nearest neighbor must be found. When a larger set of similar documents is to be retrieved, the k-d tree approach is more effective and efficient.},
booktitle = {Proceedings of the 2013 Conference on the Theory of Information Retrieval},
pages = {101–108},
numpages = {8},
keywords = {latent Dirichlet allocation, document similarity, topic models, approximate nearest neighbors},
location = {Copenhagen, Denmark},
series = {ICTIR '13}
}

@inproceedings{10.1145/2499178.2499185,
author = {Connor, Richard and Moss, Robert and Harvey, Morgan},
title = {A New Probabilistic Ranking Model},
year = {2013},
isbn = {9781450321075},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2499178.2499185},
doi = {10.1145/2499178.2499185},
abstract = {Over the years a number of models have been introduced as solutions to the central IR problem of ranking documents given textual queries. Here we define another new model. It is a probabilistic model and has no term inter-dependencies, thus allowing calculation from inverted indices. It is based upon a simple core hypothesis, directly calculating a ranking score in terms of probability theory. Early results show that its performance is credible, even in the absence of parameters or heuristics. Its semantic basis gives absolute results, allowing different rankings to be compared with each other. The investigation of this model is at a very early stage; here, we simply propose the model for further investigation.},
booktitle = {Proceedings of the 2013 Conference on the Theory of Information Retrieval},
pages = {109–112},
numpages = {4},
keywords = {Jensen-Shannon Divergence, ranking, information retrieval, probabilistic retrieval},
location = {Copenhagen, Denmark},
series = {ICTIR '13}
}

@inproceedings{10.1145/2499178.2499183,
author = {Cummins, Ronan},
title = {A Standard Document Score for Information Retrieval},
year = {2013},
isbn = {9781450321075},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2499178.2499183},
doi = {10.1145/2499178.2499183},
abstract = {In this paper we propose a standard document retrieval score based on term-frequencies. We model the within-document term-frequency aspect of each term as a random variable. The standard score is then used to transform each random variable to a regularised form so that they can be effectively combined for use as a standard document score. The standardisation used imposes no constraints on the choice of probability distribution for the term-frequencies.We show that the standardisation automatically creates a measure of term-specificity. Analysis shows that this measure is highly correlated with the traditional idf measure, and furthermore suggests a novel interpretation and justification of idf-like measures. With experiments on a number of different TREC collections, we show that the standard document score model is comparable with BM25. However, we show that an advantage of the standard document score model is that the document scores output from the model are dimensionless quantities, and therefore are comparable across different queries and collections in certain circumstances.},
booktitle = {Proceedings of the 2013 Conference on the Theory of Information Retrieval},
pages = {113–116},
numpages = {4},
keywords = {Normalisation, Standard Score},
location = {Copenhagen, Denmark},
series = {ICTIR '13}
}

@inproceedings{10.1145/2499178.2499180,
author = {Clinchant, St\'{e}phane and Perronnin, Florent},
title = {Textual Similarity with a Bag-of-Embedded-Words Model},
year = {2013},
isbn = {9781450321075},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2499178.2499180},
doi = {10.1145/2499178.2499180},
abstract = {While words in documents are generally treated as discrete entities, they can be embedded in a Euclidean space which reflects an a priori notion of similarity between them. In such a case, a text document can be viewed as a bag-of-embedded-words (BoEW): a set of real-valued vectors. We propose a novel document representation based on such continuous word embeddings. It consists in non-linearly mapping the word-embeddings in a higher-dimensional space and in aggregating them into a document-level representation. We report retrieval experiments in the case where the word-embeddings are computed from standard topic models showing significant improvements with respect to the original topic models.},
booktitle = {Proceedings of the 2013 Conference on the Theory of Information Retrieval},
pages = {117–120},
numpages = {4},
keywords = {Probabilistic Models, Fisher Kernel, Word Embeddings, IR Theory},
location = {Copenhagen, Denmark},
series = {ICTIR '13}
}

@inproceedings{10.1145/2499178.2499194,
author = {Karimzadehgan, Maryam and Zhai, ChengXiang and Efron, Miles},
title = {Statistical Translation Language Model for Twitter Search},
year = {2013},
isbn = {9781450321075},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2499178.2499194},
doi = {10.1145/2499178.2499194},
abstract = {With the prevalence of social media applications, an increasing number of internet users are actively publishing text information on-line. This influx provides a wealth of text information on those users. Ranking in social media poses different challenges than Web search ranking, one of which is that Microblog messages are really short. As a result, the vocabulary mismatch problem is exacerbated in social media search. In this paper, we first study the standard translation model for this problem and reveal that translation language model not only helps to bridge the vocabulary gap but also improves the estimate of Term Frequency. We further propose two ways to improve translation language model through leveraging Hashtag information and adaptively setting the self-translation parameter. Experimental results on Twitter data set show that our proposed methods are effective.},
booktitle = {Proceedings of the 2013 Conference on the Theory of Information Retrieval},
pages = {121–124},
numpages = {4},
keywords = {Twitter, Hashtag, Statistical Machine Translation},
location = {Copenhagen, Denmark},
series = {ICTIR '13}
}

@inproceedings{10.1145/2499178.2499199,
author = {Buccio, Emanuele Di and Nunzio, Giorgio Maria Di},
title = {More Than Words: A Review of Planets, Stars and Sample Spaces},
year = {2013},
isbn = {9781450321075},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2499178.2499199},
doi = {10.1145/2499178.2499199},
abstract = {This work discusses the consequences of choosing a sample space based on the interpretation of an experiment. We discuss the paradoxes that have been extensively studied in literature, and then we propose an alternative interpretation of the problem of document classification.},
booktitle = {Proceedings of the 2013 Conference on the Theory of Information Retrieval},
pages = {125–126},
numpages = {2},
keywords = {Classical Probabilistic Models, Information Visualization},
location = {Copenhagen, Denmark},
series = {ICTIR '13}
}

@inproceedings{10.1145/2499178.2499200,
author = {Buccio, Emanuele Di and Nunzio, Giorgio Maria Di},
title = {A Visual Analysis of the Effects of Assumptions of Classical Probabilistic Models},
year = {2013},
isbn = {9781450321075},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2499178.2499200},
doi = {10.1145/2499178.2499200},
abstract = {This poster discusses the main assumptions of classical probabilistic models in IR by means of a visual data analysis approach. Starting from the problem of classification of documents into relevant and non relevant classes, we derive the exact same formula of the relevance weight of the Binary Independence Model but with more degrees of interaction. With this approach, new factors can be taken into account to obtain a different ranking of the documents.},
booktitle = {Proceedings of the 2013 Conference on the Theory of Information Retrieval},
pages = {127–128},
numpages = {2},
keywords = {Information Visualization, Classical Probabilistic Models},
location = {Copenhagen, Denmark},
series = {ICTIR '13}
}

@inproceedings{10.1145/2499178.2499193,
author = {Derczynski, Leon and Gaizauskas, Robert},
title = {Information Retrieval for Temporal Bounding},
year = {2013},
isbn = {9781450321075},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2499178.2499193},
doi = {10.1145/2499178.2499193},
abstract = {The temporal bounding problem is that of finding the beginning and ending times of a temporal interval during which an assertion holds. Existing approaches to temporal bounding have assumed the provision of a reference document from which to extract temporal bounds. We argue that a real-world setting does not include a reference document and that an information retrieval step is often required in order to locate documents containing candidate beginning and end times. We call this task "Information Retrieval for Temporal Bounding". This paper defines the task and discusses suitable evaluation metrics, as well as demonstrating the task's difficulty using a reference dataset.},
booktitle = {Proceedings of the 2013 Conference on the Theory of Information Retrieval},
pages = {129–130},
numpages = {2},
keywords = {Event mining, Knowledge base population, Temporal bounding},
location = {Copenhagen, Denmark},
series = {ICTIR '13}
}

@inproceedings{10.1145/2499178.2499197,
author = {Martinez-Alvarez, Miguel and Bonzanini, Marco and Roelleke, Thomas},
title = {Mathematical Specification and Logic Modelling in the Context of IR},
year = {2013},
isbn = {9781450321075},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2499178.2499197},
doi = {10.1145/2499178.2499197},
abstract = {Many IR models and tasks rely on a mathematical specification, and, in order to check its correctness, extensive testing and manual inspection is usually carried out. However, a formal guarantee can be particularly difficult, or even impossible, to provide.This poster highlights the relationship between the mathematical specification of IR algorithms and their modelling, using a logic-based abstraction that minimises the gap between the specification and a concrete implementation. As a result, the semantics of the program are well-defined and correctness checks can be applied. This methodology is illustrated with the mathematical specification, and logic modelling of a Bayesian classifier with Laplace smoothing. In addition to closing the gap between specification and modelling, and the fact that checking the correctness of a model's implementation becomes an inherent part of the design process, this work can lead to the automatic translation between the mathematical definition and its modelling.},
booktitle = {Proceedings of the 2013 Conference on the Theory of Information Retrieval},
pages = {131–132},
numpages = {2},
keywords = {Abstraction, Logic, Correctness, Verification},
location = {Copenhagen, Denmark},
series = {ICTIR '13}
}

@inproceedings{10.1145/2499178.2499198,
author = {Metrikov, Pavel and Wu, Jie and Anderton, Jesse and Pavlu, Virgil and Aslam, Javed A.},
title = {A Modification of LambdaMART to Handle Noisy Crowdsourced Assessments},
year = {2013},
isbn = {9781450321075},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2499178.2499198},
doi = {10.1145/2499178.2499198},
abstract = {We consider noisy crowdsourced assessments and their impact on learning-to-rank algorithms. Starting with EM-weighted assessments, we modify LambdaMART in order to use smoothed probabilistic preferences over pairs of documents, directly as input to the ranking algorithm.},
booktitle = {Proceedings of the 2013 Conference on the Theory of Information Retrieval},
pages = {133–134},
numpages = {2},
keywords = {Learning-to-Rank, Crowdsourcing, Probabilistic Pairwise Preferences},
location = {Copenhagen, Denmark},
series = {ICTIR '13}
}

license: Unlicense

repository: goyalkaraniit/acm-cr

repo_name: goyalkaraniit/acm-cr


text:
#
# FindFreeTypeGL - Try to find FreeTypeGL library and include path.
# Once done this will define
#
# FREETYPEGL_FOUND
# FREETYPEGL_INCLUDE_PATH
# FREETYPEGL_LIBRARY
#

IF (WIN32)
	FIND_PATH( FREETYPEGL_INCLUDE_PATH freetype-gl/freetype-gl.h
		$ENV{PROGRAMFILES}/freetype-gl/include
   	${WINDOWS_INC}/SOIL2/SOIL2.h ${WINDOWS_INC}/SOIL2.h
		${FREETYPEGL_ROOT_DIR}/include
		DOC "The directory where freetype-gl/freetype-gl.h resides")

    FIND_LIBRARY( FREETYPEGL_LIBRARY
        NAMES freetype-gl freetype-gl32 freetype-gl32s
        PATHS
        $ENV{PROGRAMFILES}/freetype-gl/lib
        ${FREETYPEGL_ROOT_DIR}/lib
        DOC "The FreeType-GL library")
ELSE (WIN32)
	FIND_PATH( FREETYPEGL_INCLUDE_PATH freetype-gl/freetype-gl.h
		/usr/include
		/usr/local/include
		/sw/include
		/opt/local/include
		${FREETYPEGL_ROOT_DIR}/include
		DOC "The directory where freetype-gl/freetype-gl.h resides")

	# Prefer the static library.
	FIND_LIBRARY( FREETYPEGL_LIBRARY
		NAMES libfreetype-gl.a
		PATHS
		/usr/lib64
		/usr/lib
		/usr/local/lib64
		/usr/local/lib
		/sw/lib
		/opt/local/lib
		${FREETYPEGL_ROOT_DIR}/lib
		DOC "The FreeType-GL library")
ENDIF (WIN32)

SET(FREETYPEGL_FOUND "NO")
IF (FREETYPEGL_INCLUDE_PATH AND FREETYPEGL_LIBRARY)
	SET(FREETYPEGL_LIBRARIES ${FREETYPEGL_LIBRARY})
	SET(FREETYPEGL_FOUND "YES")
ENDIF (FREETYPEGL_INCLUDE_PATH AND FREETYPEGL_LIBRARY)

INCLUDE(${CMAKE_ROOT}/Modules/FindPackageHandleStandardArgs.cmake)
FIND_PACKAGE_HANDLE_STANDARD_ARGS(FREETYPEGL DEFAULT_MSG FREETYPEGL_LIBRARY)

license: MIT

repository: gill-wang/PnPTrainer

license_type: permissive

repo_name: gill-wang/PnPTrainer

branch_name: refs/heads/master

extension: cmake


text:
% Encoding: UTF-8

@Article{Timoshenko2017,
  author    = {Janis Timoshenko and Deyu Lu and Yuewei Lin and Anatoly I. Frenkel},
  journal   = {The Journal of Physical Chemistry Letters},
  title     = {Supervised Machine-Learning-Based Determination of Three-Dimensional Structure of Metallic Nanoparticles},
  year      = {2017},
  month     = {oct},
  number    = {20},
  pages     = {5091--5098},
  volume    = {8},
  doi       = {10.1021/acs.jpclett.7b02364},
  file      = {:Papers/Frenkel2017_SML_XANES.pdf:PDF},
  publisher = {American Chemical Society ({ACS})},
}

@Article{timoshenko2018neural,
  author    = {Timoshenko, Janis and Anspoks, Andris and Cintins, Arturs and Kuzmin, Alexei and Purans, Juris and Frenkel, Anatoly I},
  journal   = {Physical review letters},
  title     = {Neural network approach for characterizing structural transformations by X-ray absorption fine structure spectroscopy},
  year      = {2018},
  number    = {22},
  pages     = {225502},
  volume    = {120},
  file      = {:Papers/Frenkel2018_NN_EXAFS.pdf:PDF},
  publisher = {APS},
}

@Article{ng2011sparse,
  author  = {Ng, Andrew and others},
  journal = {CS294A Lecture notes},
  title   = {Sparse autoencoder},
  year    = {2011},
  number  = {2011},
  pages   = {1--19},
  volume  = {72},
  file    = {:Papers/sparseAutoencoder.pdf:PDF},
}

@Article{Bhowick2019,
  author        = {Debjani Bhowick and Deepak K. Gupta and Saumen Maiti and Uma Shankar},
  title         = {Stacked autoencoders based machine learning for noise reduction and signal reconstruction in geophysical data},
  year          = {2019},
  month         = jul,
  abstract      = {Autoencoders are neural network formulations where the input and output of the network are identical and the goal is to identify the hidden representation in the provided datasets. Generally, autoencoders project the data nonlinearly onto a lower dimensional hidden space, where the important features get highlighted and interpretation of the data becomes easier. Recent studies have shown that even in the presence of noise in the input data, autoencoders can be trained to reconstruct the noisefree component of the data from the reduced-dimensional hidden space. In this paper, we explore the application of autoencoders within the scope of denoising geophysical datasets using a data-driven methodology. The autoencoder formulation is discussed, and a stacked variant of deep autoencoders is proposed. The proposed method involves locally training the weights first using basic autoencoders, each comprising a single hidden layer. Using these initialized weights as starting points in the optimization model, the full autoencoder network is then trained in the second step. The applicability of denoising autoencoders has been demonstrated on a basic mathematical example and several geophysical examples. For all the cases, autoencoders are found to significantly reduce the noise in the input data.},
  archiveprefix = {arXiv},
  eprint        = {1907.03278},
  file          = {:Bhowick2019 - Stacked Autoencoders Based Machine Learning for Noise Reduction and Signal Reconstruction in Geophysical Data.pdf:PDF},
  keywords      = {eess.SP, physics.geo-ph},
  primaryclass  = {eess.SP},
}

@PhdThesis{gardenghi2012synchrotron,
  author = {Gardenghi, David Jeremiah and others},
  school = {Montana State University-Bozeman, College of Letters \& Science},
  title  = {Synchrotron radiation-based spectroscopic investigation of the electronic and geometric structures of iron-sulfur clusters, particles, and minerals},
  year   = {2012},
  file   = {Good summary of EXAFS and XANES:Papers/GardenghiD0512.pdf:PDF},
}

@Article{firstSynchrotronRadPaper,
  author    = {Elder, F. R. and Gurewitsch, A. M. and Langmuir, R. V. and Pollock, H. C.},
  journal   = {Phys. Rev.},
  title     = {Radiation from Electrons in a Synchrotron},
  year      = {1947},
  month     = {Jun},
  pages     = {829--830},
  volume    = {71},
  doi       = {10.1103/PhysRev.71.829.5},
  file      = {:Papers/synchrotron_radiation_source.pdf:PDF},
  issue     = {11},
  numpages  = {0},
  publisher = {American Physical Society},
  url       = {https://link.aps.org/doi/10.1103/PhysRev.71.829.5},
}

@Article{rehrXAFS2000review,
  author    = {Rehr, John J and Albers, Robert C},
  journal   = {Reviews of Modern Physics},
  title     = {Theoretical approaches to x-ray absorption fine structure},
  year      = {2000},
  number    = {3},
  pages     = {621},
  volume    = {72},
  file      = {:Papers/XAFS/rehr2000.pdf:PDF},
  publisher = {APS},
}

@Article{newville2014fundamentals,
  author    = {Newville, Matthew},
  journal   = {Reviews in Mineralogy and Geochemistry},
  title     = {Fundamentals of {XAFS}},
  year      = {2014},
  number    = {1},
  pages     = {33--74},
  volume    = {78},
  file      = {:Papers/XAFS/RIMG78_EXAFS_Newville.pdf:PDF},
  publisher = {Mineralogical Society of America},
}

@Article{fricke1920,
  author    = {Fricke, Hugo},
  journal   = {Physical Review},
  title     = {The K-characteristic absorption frequencies for the chemical elements magnesium to chromium},
  year      = {1920},
  number    = {3},
  pages     = {202},
  volume    = {16},
  publisher = {APS},
}

@Article{hertz1920ueber,
  author  = {Hertz, G},
  journal = {Zeitschrift für Physik},
  title   = {Über die Absorptionsgrenzen in der L-Serie},
  year    = {1920},
  number  = {1},
  pages   = {19--25},
  volume  = {3},
}

@Article{skewnorm_Azzalini_1999,
  author    = {Azzalini, A. and Capitanio, A.},
  journal   = {Journal of the Royal Statistical Society: Series B (Statistical Methodology)},
  title     = {Statistical applications of the multivariate skew normal distribution},
  year      = {1999},
  issn      = {1467-9868},
  month     = {Aug},
  number    = {3},
  pages     = {579–602},
  volume    = {61},
  doi       = {10.1111/1467-9868.00194},
  publisher = {Wiley},
  url       = {http://dx.doi.org/10.1111/1467-9868.00194},
}

@Article{2020SciPy-NMeth,
  author  = {Virtanen, Pauli and Gommers, Ralf and Oliphant, Travis E. and Haberland, Matt and Reddy, Tyler and Cournapeau, David and Burovski, Evgeni and Peterson, Pearu and Weckesser, Warren and Bright, Jonathan and {van der Walt}, St{\'e}fan J. and Brett, Matthew and Wilson, Joshua and Millman, K. Jarrod and Mayorov, Nikolay and Nelson, Andrew R. J. and Jones, Eric and Kern, Robert and Larson, Eric and Carey, C J and Polat, {\.I}lhan and Feng, Yu and Moore, Eric W. and {VanderPlas}, Jake and Laxalde, Denis and Perktold, Josef and Cimrman, Robert and Henriksen, Ian and Quintero, E. A. and Harris, Charles R. and Archibald, Anne M. and Ribeiro, Ant{\^o}nio H. and Pedregosa, Fabian and {van Mulbregt}, Paul and {SciPy 1.0 Contributors}},
  journal = {Nature Methods},
  title   = {{{SciPy} 1.0: Fundamental algorithms for scientific computing in python}},
  year    = {2020},
  pages   = {261--272},
  volume  = {17},
  adsurl  = {https://rdcu.be/b08Wh},
  doi     = {10.1038/s41592-019-0686-2},
}

@Software{thomas_a_caswell_2021_4475376,
  author    = {Thomas A Caswell and Michael Droettboom and Antony Lee and Elliott Sales de Andrade and John Hunter and Eric Firing and Tim Hoffmann and Jody Klymak and David Stansby and Nelle Varoquaux and Jens Hedegaard Nielsen and Benjamin Root and Ryan May and Phil Elson and Jouni K. Seppänen and Darren Dale and Jae-Joon Lee and Damon McDougall and Andrew Straw and Paul Hobson and Christoph Gohlke and Tony S Yu and Eric Ma and Adrien F. Vincent and hannah and Steven Silvester and Charlie Moad and Nikita Kniazev and Elan Ernest and Paul Ivanov},
  doi       = {10.5281/zenodo.4475376},
  month     = jan,
  publisher = {Zenodo},
  title     = {matplotlib/matplotlib: REL: v3.3.4},
  url       = {https://doi.org/10.5281/zenodo.4475376},
  version   = {v3.3.4},
  year      = {2021},
}

@InCollection{lin2020machine,
  author    = {Lin, Yuewei and Topsakal, Mehmet and Timoshenko, Janis and Lu, Deyu and Yoo, Shinjae and Frenkel, Anatoly I},
  booktitle = {Handbook on Big Data and Machine Learning in the Physical Sciences: Volume 2. Advanced Analysis Solutions for Leading Experimental Techniques},
  publisher = {World Scientific},
  title     = {Machine-Learning Assisted Structure Determination of Metallic Nanoparticles: A Benchmark},
  year      = {2020},
  pages     = {127--140},
}

@Article{klementev2000xafs,
  author  = {Klementev, KV},
  journal = {arXiv preprint physics/0003086},
  title   = {{XAFS} spectroscopy {I}. Extracting the fine structure from the absorption spectra},
  year    = {2000},
}

@Book{exafsbook,
  author    = {Teo, Boon K},
  publisher = {Springer Science \& Business Media},
  title     = {{EXAFS}: {B}asic principles and data analysis},
  year      = {2012},
  volume    = {9},
}

@InCollection{DW-diffraction,
  author    = {M. Rühle and M. Wilkens},
  booktitle = {Physical Metallurgy (Fourth Edition)},
  publisher = {North-Holland},
  title     = {Transmission Electron Microscopy},
  year      = {1996},
  address   = {Oxford},
  chapter   = {11},
  edition   = {Fourth Edition},
  editor    = {Robert W. Cahn and Peter Haasenae },
  isbn      = {978-0-444-89875-3},
  pages     = {1033-1113},
  doi       = {https://doi.org/10.1016/B978-044489875-3/50016-8},
  url       = {https://www.sciencedirect.com/science/article/pii/B9780444898753500168},
}

@Article{schmidhuber2015deep,
  author    = {Schmidhuber, J{\"u}rgen},
  journal   = {Neural networks},
  title     = {Deep learning in neural networks: An overview},
  year      = {2015},
  pages     = {85--117},
  volume    = {61},
  doi       = {10.1016/j.neunet.2014.09.003},
  publisher = {Elsevier},
  url       = {https://arxiv.org/abs/1404.7828},
}

@Misc{tensorflow2015-whitepaper,
  author = {Martin~Abadi and Ashish~Agarwal and Paul~Barham and Eugene~Brevdo and Zhifeng~Chen and Craig~Citro and Greg~S.~Corrado and Andy~Davis and Jeffrey~Dean and Matthieu~Devin and Sanjay~Ghemawat and Ian~Goodfellow and Andrew~Harp and Geoffrey~Irving and Michael~Isard and Yangqing Jia and Rafal~Jozefowicz and Lukasz~Kaiser and Manjunath~Kudlur and Josh~Levenberg and Dandelion~Man\'{e} and Rajat~Monga and Sherry~Moore and Derek~Murray and Chris~Olah and Mike~Schuster and Jonathon~Shlens and Benoit~Steiner and Ilya~Sutskever and Kunal~Talwar and Paul~Tucker and Vincent~Vanhoucke and Vijay~Vasudevan and Fernanda~Vi\'{e}gas and Oriol~Vinyals and Pete~Warden and Martin~Wattenberg and Martin~Wicke and Yuan~Yu and Xiaoqiang~Zheng},
  note   = {Tensorflow.org},
  title  = {{TensorFlow}: Large-Scale Machine Learning on Heterogeneous Systems},
  year   = {2015},
  url    = {https://www.tensorflow.org/},
}

@InCollection{pytorch-paper,
  author    = {Paszke, Adam and Gross, Sam and Massa, Francisco and Lerer, Adam and Bradbury, James and Chanan, Gregory and Killeen, Trevor and Lin, Zeming and Gimelshein, Natalia and Antiga, Luca and Desmaison, Alban and Kopf, Andreas and Yang, Edward and DeVito, Zachary and Raison, Martin and Tejani, Alykhan and Chilamkurthy, Sasank and Steiner, Benoit and Fang, Lu and Bai, Junjie and Chintala, Soumith},
  booktitle = {Advances in Neural Information Processing Systems 32},
  publisher = {Curran Associates, Inc.},
  title     = {PyTorch: An Imperative Style, High-Performance Deep Learning Library},
  year      = {2019},
  editor    = {H. Wallach and H. Larochelle and A. Beygelzimer and F. d' Alche-Buc and E. Fox and R. Garnett},
  pages     = {8024--8035},
  url       = {http://papers.neurips.cc/paper/9015-pytorch-an-imperative-style-high-performance-deep-learning-library.pdf},
}

@Article{catalyst-strain-dependence,
  author    = {Uzio, Denis and Berhault, Gilles},
  journal   = {Catalysis Reviews},
  title     = {Factors governing the catalytic reactivity of metallic nanoparticles},
  year      = {2010},
  number    = {1},
  pages     = {106--131},
  volume    = {52},
  publisher = {Taylor \& Francis},
}

@Article{co-strain-effects,
  author    = {J{\o}rgensen, Mikkel and Gr{\"o}nbeck, Henrik},
  journal   = {Topics in Catalysis},
  title     = {Strain affects {CO} oxidation on metallic nanoparticles non-linearly},
  year      = {2019},
  number    = {7},
  pages     = {660--668},
  volume    = {62},
  publisher = {Springer},
}

@Article{gradient-descent-rev-article,
  author        = {Sebastian Ruder},
  journal       = {CoRR},
  title         = {An overview of gradient descent optimization algorithms},
  year          = {2016},
  volume        = {abs/1609.04747},
  archiveprefix = {arXiv},
  bibsource     = {dblp computer science bibliography, https://dblp.org},
  biburl        = {https://dblp.org/rec/journals/corr/Ruder16.bib},
  eprint        = {1609.04747},
  timestamp     = {Mon, 13 Aug 2018 16:48:10 +0200},
  url           = {http://arxiv.org/abs/1609.04747},
}

@Article{orig-ADAM-paper,
  author  = {Kingma, Diederik P and Ba, Jimmy},
  journal = {arXiv preprint arXiv:1412.6980},
  title   = {Adam: A method for stochastic optimization},
  year    = {2014},
}

@Book{Boas-mathmethods,
  author    = {Boas, Mary L},
  publisher = {Wiley},
  title     = {{Mathematical methods in the physical sciences; 3rd ed.}},
  year      = {2006},
  address   = {Hoboken, NJ},
  url       = {https://cds.cern.ch/record/913305},
}

@Article{cornell-convs,
  author  = {Ramin Zabih},
  journal = {Cornell University},
  title   = {CS1114 Section 6: Convolution},
  year    = {2013},
  month   = feb,
  note    = {Cornell University},
  groups  = {Cornell University},
  url     = {https://www.cs.cornell.edu/courses/cs1114/2013sp/sections/S06_convolution.pdf},
}

@Article{1dconv-NN-survey,
  author   = {Serkan Kiranyaz and Onur Avci and Osama Abdeljaber and Turker Ince and Moncef Gabbouj and Daniel J. Inman},
  journal  = {Mechanical Systems and Signal Processing},
  title    = {1D convolutional neural networks and applications: A survey},
  year     = {2021},
  issn     = {0888-3270},
  pages    = {107398},
  volume   = {151},
  abstract = {During the last decade, Convolutional Neural Networks (CNNs) have become the de facto standard for various Computer Vision and Machine Learning operations. CNNs are feed-forward Artificial Neural Networks (ANNs) with alternating convolutional and subsampling layers. Deep 2D CNNs with many hidden layers and millions of parameters have the ability to learn complex objects and patterns providing that they can be trained on a massive size visual database with ground-truth labels. With a proper training, this unique ability makes them the primary tool for various engineering applications for 2D signals such as images and video frames. Yet, this may not be a viable option in numerous applications over 1D signals especially when the training data is scarce or application specific. To address this issue, 1D CNNs have recently been proposed and immediately achieved the state-of-the-art performance levels in several applications such as personalized biomedical data classification and early diagnosis, structural health monitoring, anomaly detection and identification in power electronics and electrical motor fault detection. Another major advantage is that a real-time and low-cost hardware implementation is feasible due to the simple and compact configuration of 1D CNNs that perform only 1D convolutions (scalar multiplications and additions). This paper presents a comprehensive review of the general architecture and principals of 1D CNNs along with their major engineering applications, especially focused on the recent progress in this field. Their state-of-the-art performance is highlighted concluding with their unique properties. The benchmark datasets and the principal 1D CNN software used in those applications are also publicly shared in a dedicated website. While there has not been a paper on the review of 1D CNNs and its applications in the literature, this paper fulfills this gap.},
  doi      = {https://doi.org/10.1016/j.ymssp.2020.107398},
  keywords = {Artificial Neural Networks, Machine learning, Deep learning, Convolutional neural networks, Structural health monitoring, Condition monitoring, Arrhythmia detection and identification, Fault detection, Structural damage detection},
  url      = {https://www.sciencedirect.com/science/article/pii/S0888327020307846},
}

@InProceedings{local-translation-invariance,
  author    = {Kayhan, Osman Semih and Gemert, Jan C van},
  booktitle = {Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  title     = {On translation invariance in {CNNs}: Convolutional layers can exploit absolute spatial location},
  year      = {2020},
  pages     = {14274--14285},
}

@Misc{AdamW-orig,
  author        = {Ilya Loshchilov and Frank Hutter},
  howpublished  = {Conference Paper at ICLR 2019},
  title         = {Decoupled Weight Decay Regularization},
  year          = {2019},
  archiveprefix = {arXiv},
  eprint        = {1711.05101},
  primaryclass  = {cs.LG},
  url           = {https://arxiv.org/pdf/1711.05101.pdf},
}

@Article{grad-desc-limits,
  author    = {Wilson, D Randall and Martinez, Tony R},
  journal   = {Neural networks},
  title     = {The general inefficiency of batch training for gradient descent learning},
  year      = {2003},
  number    = {10},
  pages     = {1429--1451},
  volume    = {16},
  publisher = {Elsevier},
}

@Article{cauchy-orig-grad-descent,
  author  = {Cauchy, Augustin and others},
  journal = {Comp. Rend. Sci. Paris},
  title   = {M{\'e}thode g{\'e}n{\'e}rale pour la r{\'e}solution des systemes d’{\'e}quations simultan{\'e}es},
  year    = {1847},
  number  = {1847},
  pages   = {536--538},
  volume  = {25},
}

@InProceedings{stoch-grad-desc-parallel,
  author       = {Zinkevich, Martin and Weimer, Markus and Smola, Alexander J and Li, Lihong},
  booktitle    = {NIPS},
  title        = {Parallelized stochastic gradient descent.},
  year         = {2010},
  number       = {1},
  organization = {Citeseer},
  pages        = {4},
  volume       = {4},
}

@Article{qian1999momentum,
  author    = {Qian, Ning},
  journal   = {Neural Networks},
  title     = {On the momentum term in gradient descent learning algorithms},
  year      = {1999},
  number    = {1},
  pages     = {145--151},
  volume    = {12},
  publisher = {Elsevier},
}

@InProceedings{improving-rprop,
  author       = {Igel, Christian and H{\"u}sken, Michael},
  booktitle    = {Proceedings of the Second International ISCS Symposium on Neural Computation (NC 2000)},
  title        = {Improving the {R}prop learning algorithm},
  year         = {2000},
  organization = {Citeseer},
  pages        = {115--121},
  volume       = {2000},
}

@Article{adagrad,
  author  = {Duchi, John and Hazan, Elad and Singer, Yoram},
  journal = {Journal of Machine Learning Research},
  title   = {Adaptive subgradient methods for online learning and stochastic optimization.},
  year    = {2011},
  number  = {7},
  volume  = {12},
}

@Article{2017marginal-adagrad,
  author  = {Wilson, Ashia C and Roelofs, Rebecca and Stern, Mitchell and Srebro, Nathan and Recht, Benjamin},
  journal = {arXiv preprint arXiv:1705.08292},
  title   = {The marginal value of adaptive gradient methods in machine learning},
  year    = {2017},
}

@InProceedings{batch-norm-orig,
  author       = {Ioffe, Sergey and Szegedy, Christian},
  booktitle    = {International Conference on Machine Learning},
  title        = {Batch normalization: Accelerating deep network training by reducing internal covariate shift},
  year         = {2015},
  organization = {PMLR},
  pages        = {448--456},
}

@InProceedings{batch-norm-conference,
  author    = {Santurkar, Shibani and Tsipras, Dimitris and Ilyas, Andrew and Madry, Aleksander},
  booktitle = {Proceedings of the 32nd International Conference on Neural Information Processing Systems},
  title     = {How does batch normalization help optimization?},
  year      = {2018},
  pages     = {2488--2498},
}

@Article{deepCNNforImages,
  author    = {Rawat, Waseem and Wang, Zenghui},
  journal   = {Neural Computation},
  title     = {Deep convolutional neural networks for image classification: A comprehensive review},
  year      = {2017},
  number    = {9},
  pages     = {2352--2449},
  volume    = {29},
  publisher = {MIT Press},
}

@Article{grad-desc-with-mom-orig,
  author    = {Rumelhart, David E and Hinton, Geoffrey E and Williams, Ronald J},
  journal   = {Nature},
  title     = {Learning representations by back-propagating errors},
  year      = {1986},
  number    = {6088},
  pages     = {533--536},
  volume    = {323},
  publisher = {Nature Publishing Group},
}

@Bathesis{williamsThesis,
  author = {Thaller, Jeremy},
  doi    = {10.5281/zenodo.4030517},
  school = {Williams College},
  title  = {Toward a direct measurement of strain-dependent surface stress in soft solids},
  year   = {2019},
}

@Book{statsTextbook,
  author    = {Larson, Ron and Farber, Betsy},
  publisher = {Pearson Education Canada},
  title     = {Elementary statistics},
  year      = {2019},
}

@InProceedings{whybatchnorm2,
  author       = {Kohler, Jonas and Daneshmand, Hadi and Lucchi, Aurelien and Hofmann, Thomas and Zhou, Ming and Neymeyr, Klaus},
  booktitle    = {The 22nd International Conference on Artificial Intelligence and Statistics},
  title        = {Exponential convergence rates for batch normalization: The power of length-direction decoupling in non-convex optimization},
  year         = {2019},
  organization = {PMLR},
  pages        = {806--815},
}

@Article{whybatchnorm3,
  author  = {Yang, Greg and Pennington, Jeffrey and Rao, Vinay and Sohl-Dickstein, Jascha and Schoenholz},
  journal = {arXiv preprint arXiv:1902.08129},
  title   = {A mean field theory of batch normalization},
  year    = {2019},
}

@Article{conv-dropout-layers,
  author  = {Cai, Shaofeng and Shu, Yao and Chen, Gang and Ooi, Beng Chin and Wang, Wei and Zhang, Meihui},
  journal = {arXiv preprint arXiv:1904.03392},
  title   = {Effective and efficient dropout for deep convolutional neural networks},
  year    = {2019},
}

@Article{conv-dropout-layers2,
  author    = {Wu, Haibing and Gu, Xiaodong},
  journal   = {Neural Networks},
  title     = {Towards dropout training for convolutional neural networks},
  year      = {2015},
  pages     = {1--10},
  volume    = {71},
  publisher = {Elsevier},
}

@Article{gold-lattice-const,
  author    = {Boswell, Frank William Charles},
  journal   = {Proceedings of the Physical Society. Section A},
  title     = {Precise determination of lattice constants by electron diffraction and variations in the lattice constants of very small crystallites},
  year      = {1951},
  number    = {5},
  pages     = {465},
  volume    = {64},
  publisher = {IOP Publishing},
}

@Article{numpy,
  author    = {Charles R. Harris and K. Jarrod Millman and St{\'{e}}fan J. van der Walt and Ralf Gommers and Pauli Virtanen and David Cournapeau and Eric Wieser and Julian Taylor and Sebastian Berg and Nathaniel J. Smith and Robert Kern and Matti Picus and Stephan Hoyer and Marten H. van Kerkwijk and Matthew Brett and Allan Haldane and Jaime Fern{\'{a}}ndez del R{\'{i}}o and Mark Wiebe and Pearu Peterson and Pierre G{\'{e}}rard-Marchant and Kevin Sheppard and Tyler Reddy and Warren Weckesser and Hameer Abbasi and Christoph Gohlke and Travis E. Oliphant},
  journal   = {Nature},
  title     = {Array programming with {NumPy}},
  year      = {2020},
  month     = sep,
  number    = {7825},
  pages     = {357--362},
  volume    = {585},
  doi       = {10.1038/s41586-020-2649-2},
  publisher = {Springer Science and Business Media {LLC}},
  url       = {https://doi.org/10.1038/s41586-020-2649-2},
}

@Article{seaborn,
  author    = {Michael L. Waskom},
  journal   = {Journal of Open Source Software},
  title     = {seaborn: statistical data visualization},
  year      = {2021},
  number    = {60},
  pages     = {3021},
  volume    = {6},
  doi       = {10.21105/joss.03021},
  publisher = {The Open Journal},
  url       = {https://doi.org/10.21105/joss.03021},
}

@Article{data-augmentation1,
  author    = {Van Dyk, David A and Meng, Xiao-Li},
  journal   = {Journal of Computational and Graphical Statistics},
  title     = {The art of data augmentation},
  year      = {2001},
  number    = {1},
  pages     = {1--50},
  volume    = {10},
  publisher = {Taylor \& Francis},
}

@Article{data-augmentation2,
  author    = {Fr{\"u}hwirth-Schnatter, Sylvia},
  journal   = {Journal of Time Series Analysis},
  title     = {Data augmentation and dynamic linear models},
  year      = {1994},
  number    = {2},
  pages     = {183--202},
  volume    = {15},
  publisher = {Wiley Online Library},
}

@Article{data-augmentation3,
  author  = {Perez, Luis and Wang, Jason},
  journal = {arXiv preprint arXiv:1712.04621},
  title   = {The effectiveness of data augmentation in image classification using deep learning},
  year    = {2017},
}

@Article{data-augmentation4,
  author    = {Tanner, Martin A and Wong, Wing Hung},
  journal   = {Journal of the American Statistical Association},
  title     = {The calculation of posterior distributions by data augmentation},
  year      = {1987},
  number    = {398},
  pages     = {528--540},
  volume    = {82},
  publisher = {Taylor \& Francis},
}

@Article{data-augmentation5,
  author    = {Shorten, Connor and Khoshgoftaar, Taghi M},
  journal   = {Journal of Big Data},
  title     = {A survey on image data augmentation for deep learning},
  year      = {2019},
  number    = {1},
  pages     = {1--48},
  volume    = {6},
  publisher = {Springer},
}

@Article{dropout-srivastava2014,
  author    = {Srivastava, Nitish and Hinton, Geoffrey and Krizhevsky, Alex and Sutskever, Ilya and Salakhutdinov, Ruslan},
  journal   = {The Journal of Machine Learning Research},
  title     = {Dropout: a simple way to prevent neural networks from overfitting},
  year      = {2014},
  number    = {1},
  pages     = {1929--1958},
  volume    = {15},
  publisher = {JMLR. org},
}

@Article{regularization-2017survey,
  author  = {Kukavcka, Jan and Golkov, Vladimir and Cremers, Daniel},
  journal = {arXiv preprint arXiv:1710.10686},
  title   = {Regularization for deep learning: A taxonomy},
  year    = {2017},
}

@Article{transferlearning-reminder,
  author  = {Bozinovski, Stevo},
  journal = {Informatica},
  title   = {Reminder of the first paper on transfer learning in neural networks, 1976},
  year    = {2020},
  number  = {3},
  volume  = {44},
}

@Article{transferlearning2,
  author    = {Pan, Sinno Jialin and Yang, Qiang},
  journal   = {IEEE Transactions on Knowledge and Data Engineering},
  title     = {A survey on transfer learning},
  year      = {2009},
  number    = {10},
  pages     = {1345--1359},
  volume    = {22},
  publisher = {IEEE},
}

@InCollection{transferlearning3,
  author    = {Torrey, Lisa and Shavlik, Jude},
  booktitle = {Handbook of Research on Machine Learning Applications and Trends: Algorithms, Methods, and Techniques},
  publisher = {IGI Global},
  title     = {Transfer learning},
  year      = {2010},
  pages     = {242--264},
}

@InProceedings{transferBook,
  author    = {Rosenstein, Michael T and Marx, Zvika and Kaelbling, Leslie Pack and Dietterich, Thomas G},
  booktitle = {NIPS 2005 Workshop on Transfer Learning},
  title     = {To transfer or not to transfer},
  year      = {2005},
  pages     = {1--4},
  volume    = {898},
}

@Article{ny-pastry-article,
  author  = {Somers, James},
  journal = {The New Yorker},
  title   = {{T}he pastry {A}.{I}. that learned {t}o fight cancer},
  year    = {2021},
  month   = {Mar},
}

@Article{crooks-55nm-au-exp,
  author    = {Kim, Yong-Gu and Oh, Sang-Keun and Crooks, Richard M},
  journal   = {Chemistry of Materials},
  title     = {Preparation and characterization of 1- 2 nm dendrimer-encapsulated gold nanoparticles having very narrow size distributions},
  year      = {2004},
  number    = {1},
  pages     = {167--172},
  volume    = {16},
  publisher = {ACS Publications},
}

@Article{jing-au-nanoparticle-exp,
  author    = {Guo, Yu and Gu, Dong and Jin, Zhao and Du, Pei-Pei and Si, Rui and Tao, Jing and Xu, Wen-Qian and Huang, Yu-Ying and Senanayake, Sanjaya and Song, Qi-Sheng and others},
  journal   = {Nanoscale},
  title     = {Uniform 2 nm gold nanoparticles supported on iron oxides as active catalysts for CO oxidation reaction: structure--activity relationship},
  year      = {2015},
  number    = {11},
  pages     = {4920--4928},
  volume    = {7},
  publisher = {Royal Society of Chemistry},
}

@Article{au-nanowires-silca-wang,
  author    = {Pao, C-W and Wu, C-T and Tsai, H-M and Liu, Y-S and Chang, C-L and Pong, WF and Chiou, J-W and Chen, C-W and Hu, M-S and Chu, M-W and others},
  journal   = {Physical Review B},
  title     = {Photoconduction and the electronic structure of silica nanowires embedded with gold nanoparticles},
  year      = {2011},
  number    = {16},
  pages     = {165412},
  volume    = {84},
  publisher = {APS},
  url       = {https://core.ac.uk/download/pdf/225225705.pdf},
}

@Article{ML-and-the-physical-sci,
  author    = {Carleo, Giuseppe and Cirac, Ignacio and Cranmer, Kyle and Daudet, Laurent and Schuld, Maria and Tishby, Naftali and Vogt-Maranto, Leslie and Zdeborova, Lenka},
  journal   = {Reviews of Modern Physics},
  title     = {Machine learning and the physical sciences},
  year      = {2019},
  number    = {4},
  pages     = {045002},
  volume    = {91},
  publisher = {APS},
}

@Article{szegedy2013deep,
  author  = {Szegedy, Christian and Toshev, Alexander and Erhan, Dumitru},
  journal = {Advances in Neural Information Processing Systems},
  title   = {{D}eep neural networks for object detection},
  year    = {2013},
  pages   = {1--9},
  volume  = {26},
}

@InProceedings{chatbots,
  author       = {Lokman, Abbas Saliimi and Ameedeen, Mohamed Ariff},
  booktitle    = {Proceedings of the Future Technologies Conference},
  title        = {Modern chatbot systems: A technical review},
  year         = {2018},
  organization = {Springer},
  pages        = {1012--1023},
}

@InProceedings{virtual-assistants,
  author       = {Lopez, Gustavo and Quesada, Luis and Guerrero, Luis A},
  booktitle    = {International Conference on Applied Human Factors and Ergonomics},
  title        = {Alexa vs. {S}iri vs. {C}ortana vs. {G}oogle {A}ssistant: a comparison of speech-based natural user interfaces},
  year         = {2017},
  organization = {Springer},
  pages        = {241--250},
}

@Article{virtual-assistants2,
  author    = {Sarikaya, Ruhi},
  journal   = {IEEE Signal Processing Magazine},
  title     = {The technology behind personal digital assistants: An overview of the system architecture and key components},
  year      = {2017},
  number    = {1},
  pages     = {67--81},
  volume    = {34},
  publisher = {IEEE},
}

@Article{speech-recognition,
  author  = {Ruan, Sherry and Wobbrock, Jacob O and Liou, Kenny and Ng, Andrew and Landay, James},
  journal = {arXiv preprint arXiv:1608.07323},
  title   = {Speech is 3x faster than typing for english and mandarin text entry on mobile devices},
  year    = {2016},
}

@Article{feff-citation,
  author    = {Newville, Matthew},
  journal   = {Journal of synchrotron radiation},
  title     = {{EXAFS} Analysis using {FEFF} and {FEFFIT}},
  year      = {2001},
  number    = {2},
  pages     = {96--100},
  volume    = {8},
  publisher = {International Union of Crystallography},
}

@Article{rehr2010parameter,
  author    = {Rehr, John J and Kas, Joshua J and Vila, Fernando D and Prange, Micah P and Jorissen, Kevin},
  journal   = {Physical Chemistry Chemical Physics},
  title     = {Parameter-free {C}alculations of {X}-ray {S}pectra with {FEFF}9},
  year      = {2010},
  number    = {21},
  pages     = {5503--5513},
  volume    = {12},
  publisher = {Royal Society of Chemistry},
}

@InProceedings{feff-new-dev,
  author       = {Jorissen, Kevin and Rehr, John J},
  booktitle    = {Journal of Physics: Conference Series},
  title        = {{N}ew developments in {FEFF}: {FEFF}9 and {JFEFF}},
  year         = {2013},
  number       = {1},
  organization = {IOP Publishing},
  pages        = {012001},
  volume       = {430},
}

@InProceedings{carla-dosovitskiy2017,
  author       = {Dosovitskiy, Alexey and Ros, German and Codevilla, Felipe and Lopez, Antonio and Koltun, Vladlen},
  booktitle    = {Conference on Robot Learning},
  title        = {{CARLA}: An open urban driving simulator},
  year         = {2017},
  organization = {PMLR},
  pages        = {1--16},
  url          = {http://proceedings.mlr.press/v78/dosovitskiy17a/dosovitskiy17a.pdf},
}

@Article{mit-self-driving-car-simulations,
  author  = {Amini, Alexander and Gilitschenski, Igor and Phillips, Jacob and Moseyko, Julia and Banerjee, Rohan and Karaman, Sertac and Rus, Daniela},
  journal = {IEEE Robotics and Automation Letters},
  title   = {Learning Robust Control Policies for End-to-End Autonomous Driving From Data-Driven Simulation},
  year    = {2020},
  number  = {2},
  pages   = {1143-1150},
  volume  = {5},
  doi     = {10.1109/LRA.2020.2966414},
}

@Article{one-shot-learning,
  author  = {Vinyals, Oriol and Blundell, Charles and Lillicrap, Timothy and Wierstra, Daan and others},
  journal = {Advances in Neural Information Processing Systems},
  title   = {Matching networks for one shot learning},
  year    = {2016},
  pages   = {3630--3638},
  volume  = {29},
}

@Article{few-shot-learning,
  author  = {Ravi, Sachin and Larochelle, Hugo},
  journal = {Published as a Conference Paper at ICLR 2017},
  title   = {Optimization as a model for few-shot learning},
  year    = {2016},
}

@InProceedings{zero-shot-learning,
  author    = {Xian, Yongqin and Schiele, Bernt and Akata, Zeynep},
  booktitle = {Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition},
  title     = {Zero-shot learning --The good, the bad and the ugly},
  year      = {2017},
  pages     = {4582--4591},
}

@InProceedings{pandas-1,
  author    = {{W}es {M}c{K}inney},
  booktitle = {{P}roceedings of the 9th python in science conference},
  title     = {{D}ata structures for statistical computing in python},
  year      = {2010},
  editor    = {{S}t\'efan van der {W}alt and {J}arrod {M}illman},
  pages     = {56 - 61},
  doi       = {10.25080/Majora-92bf1922-00a},
}

@Software{pandas-2,
  author    = {{The Pandas Development Team}},
  doi       = {10.5281/zenodo.3509134},
  month     = feb,
  publisher = {Zenodo},
  title     = {pandas-dev/pandas: Pandas},
  url       = {https://doi.org/10.5281/zenodo.3509134},
  version   = {latest},
  year      = {2020},
}

@Article{RMC-xanes,
  author    = {Gurman, SJ and McGreevy, RL},
  journal   = {Journal of Physics: Condensed Matter},
  title     = {Reverse Monte Carlo simulation for the analysis of {EXAFS} data},
  year      = {1990},
  number    = {48},
  pages     = {9463},
  volume    = {2},
  publisher = {IOP Publishing},
}

@Article{mol-dyn-xanes,
  author    = {Palmer, Bruce J and Pfund, David M and Fulton, John L},
  journal   = {The Journal of Physical Chemistry},
  title     = {Direct modeling of {EXAFS} spectra from molecular dynamics simulations},
  year      = {1996},
  number    = {32},
  pages     = {13393--13398},
  volume    = {100},
  publisher = {ACS Publications},
}

@InProceedings{orig-relu,
  author    = {Nair, Vinod and Hinton, Geoffrey E},
  booktitle = {International Confrence on Machine Learning (ICML)},
  title     = {Rectified linear units improve restricted boltzmann machines},
  year      = {2010},
}

@Article{nn-regularization,
  author    = {Girosi, Federico and Jones, Michael and Poggio, Tomaso},
  journal   = {Neural Computation},
  title     = {Regularization theory and neural networks architectures},
  year      = {1995},
  number    = {2},
  pages     = {219--269},
  volume    = {7},
  publisher = {MIT Press},
}

@Article{greens-function-xafs-2021,
  author    = {Tan, Tun S. and Kas, J. J. and Rehr, J. J.},
  journal   = {Physical Review B},
  title     = {Real-space {G}reen's function approach for x-ray spectra at high temperature},
  year      = {2021},
  month     = {Jul},
  pages     = {035144},
  volume    = {104},
  doi       = {10.1103/PhysRevB.104.035144},
  issue     = {3},
  numpages  = {10},
  publisher = {American Physical Society},
  url       = {https://link.aps.org/doi/10.1103/PhysRevB.104.035144},
}

@Book{synchrotronbook,
  author    = {Mobilio, Settimio and Boscherini, Federico and Meneghini, Carlo},
  publisher = {Springer},
  title     = {Synchrotron radiation},
  year      = {2016},
}

@Article{einstein1905photoelectriceffect,
  author  = {Einstein, Albert},
  journal = {Annalen der Physik},
  title   = {Über einen die Erzeugung und Verwandlung des Lichtes betreffenden heuristischen Gesichtspunkt},
  year    = {1905},
  number  = {132},
  pages   = {1--16},
  volume  = {17},
}

@Article{absorptionSpecArticle,
  author    = {Penner-Hahn, James E and others},
  journal   = {Comprehensive Coordination Chemistry II},
  title     = {X-ray absorption spectroscopy},
  year      = {2003},
  pages     = {159--186},
  volume    = {2},
  publisher = {chapter},
}

@Article{,
}

@Article{exafsxanes1988,
  author = {Koningsberger, DC and Prins, Roelof},
  title  = {X-ray absorption: principles, applications, techniques of {EXAFS}, {SEXAFS}, and {XANES}},
  year   = {1988},
}

@Article{xafsXanesFermisGoldenRule,
  author    = {Ankudinov, AL and Rehr, JJ and Low, JJ and Bare, SR},
  journal   = {Topics in Catalysis},
  title     = {Theoretical interpretation of {XAFS} and {XANES} in {Pt} clusters},
  year      = {2002},
  number    = {1},
  pages     = {3--7},
  volume    = {18},
  publisher = {Springer},
}

@Article{anotherxafstocite,
  author    = {Rehr, JJ and Albers, RC and Zabinsky, SI},
  journal   = {Physical Review Letters},
  title     = {High-order multiple-scattering calculations of X-ray-absorption fine structure},
  year      = {1992},
  number    = {23},
  pages     = {3397},
  volume    = {69},
  publisher = {APS},
}

@Misc{wandb,
  author = {Biewald, Lukas},
  note   = {Wandb.com},
  title  = {Experiment Tracking with Weights and Biases},
  year   = {2020},
  url    = {https://www.wandb.com/},
}

@InProceedings{meta-learning-orig,
  author       = {Finn, Chelsea and Abbeel, Pieter and Levine, Sergey},
  booktitle    = {International Conference on Machine Learning},
  title        = {Model-agnostic meta-learning for fast adaptation of deep networks},
  year         = {2017},
  organization = {PMLR},
  pages        = {1126--1135},
}

@Article{meta-learning2018,
  author  = {Nichol, Alex and Achiam, Joshua and Schulman, John},
  journal = {arXiv preprint arXiv:1803.02999},
  title   = {On first-order meta-learning algorithms},
  year    = {2018},
}

@InProceedings{deepembeddings-few-shot,
  author       = {Wang, Yu-Xiong and Hebert, Martial},
  booktitle    = {European Conference on Computer Vision},
  title        = {Learning to learn: Model regression networks for easy small sample learning},
  year         = {2016},
  organization = {Springer},
  pages        = {616--634},
}

@Book{gold-a-value-data,
  author       = {Kaye, G.W.C. and Laby, T.H.},
  publisher    = {NPL (National Physical Laboratory)},
  title        = {Table of physical \& chemical constants},
  year         = {1995},
  edition      = {16th},
  howpublished = {\url{https://reference.wolfram.com/language/ref/ElementData.html}},
  journal      = {NPL (National Physical Laboratory)},
  reference    = {#wolfram_2021_elementdata#},
}

@Article{rehr2009ab,
  author    = {Rehr, John J and Kas, Joshua J and Prange, Micah P and Sorini, Adam P and Takimoto, Yoshinari and Vila, Fernando},
  journal   = {Comptes Rendus Physique},
  title     = {Ab initio theory and calculations of X-ray spectra},
  year      = {2009},
  number    = {6},
  pages     = {548--559},
  volume    = {10},
  publisher = {Elsevier},
}

@Article{feff-exafs-theoretical,
  author    = {Rehr, John J and Albers, Robert C},
  journal   = {Reviews of Modern Physics},
  title     = {Theoretical approaches to x-ray absorption fine structure},
  year      = {2000},
  number    = {3},
  pages     = {621},
  volume    = {72},
  publisher = {APS},
}

@Article{feff-dw,
  author    = {Vila, Fernando D and Rehr, JJ and Rossner, HH and Krappe, HJ},
  journal   = {Physical Review B},
  title     = {Theoretical x-ray absorption Debye-Waller factors},
  year      = {2007},
  number    = {1},
  pages     = {014301},
  volume    = {76},
  publisher = {APS},
}

@Article{feff-mean-free-path,
  author    = {Sorini, AP and Kas, JJ and Rehr, JJ and Prange, MP and Levine, Zachary H},
  journal   = {Physical Review B},
  title     = {Ab initio calculations of electron inelastic mean free paths and stopping powers},
  year      = {2006},
  number    = {16},
  pages     = {165111},
  volume    = {74},
  publisher = {APS},
}

@Article{feff-dirac-fock,
  author    = {Ankudinov, AL and Zabinsky, SI and Rehr, JJ},
  journal   = {Computer Physics Communications},
  title     = {Single configuration {D}irac-{F}ock atom code},
  year      = {1996},
  number    = {3},
  pages     = {359--364},
  volume    = {98},
  publisher = {Elsevier},
}

@Article{feff-multiple-scattering,
  author    = {Rehr, John J and Albers, Robert C},
  journal   = {Physical Review B},
  title     = {Scattering-matrix formulation of curved-wave multiple-scattering theory: Application to x-ray-absorption fine structure},
  year      = {1990},
  number    = {12},
  pages     = {8139},
  volume    = {41},
  publisher = {APS},
}

@Misc{keras2015,
  author    = {Chollet, Francois and others},
  title     = {Keras},
  year      = {2015},
  publisher = {GitHub.com},
  url       = {https://github.com/fchollet/keras},
}

@PhdThesis{nicks-thesis,
  author = {Nicholas J. Marcella},
  school = {Stony Brook University},
  title  = {Decoding reactive structures in bimetallic catalysts},
  year   = {2021},
}

@Article{filipponi1995x,
  author    = {Filipponi, Adriano and Di Cicco, Andrea and Natoli, Calogero Renzo},
  journal   = {Physical Review B},
  title     = {X-ray-absorption spectroscopy and n-body distribution functions in condensed matter. {I}. Theory},
  year      = {1995},
  number    = {21},
  pages     = {15122},
  volume    = {52},
  publisher = {APS},
}

@Article{filipponi1995x2,
  author    = {Filipponi, Adriano and Di Cicco, Andrea},
  journal   = {Physical Review B},
  title     = {X-ray-absorption spectroscopy and n-body distribution functions in condensed matter. {II}. Data analysis and applications},
  year      = {1995},
  number    = {21},
  pages     = {15135},
  volume    = {52},
  publisher = {APS},
}

@Article{artemis-and-athena,
  author   = {Ravel, B. and Newville, M.},
  journal  = {Journal of Synchrotron Radiation},
  title    = {ATHENA, ARTEMIS, HEPHAESTUS: data analysis for X-ray absorption spectroscopy using {IFEFFIT}},
  year     = {2005},
  number   = {4},
  pages    = {537-541},
  volume   = {12},
  abstract = {A software package for the analysis of X-ray absorption spectroscopy (XAS) data is presented. This package is based on the IFEFFIT library of numerical and XAS algorithms and is written in the Perl programming language using the Perl/Tk graphics toolkit. The programs described here are: (i) ATHENA, a program for XAS data processing, (ii) ARTEMIS, a program for EXAFS data analysis using theoretical standards from FEFF and (iii) HEPHAESTUS, a collection of beamline utilities based on tables of atomic absorption data. These programs enable high-quality data analysis that is accessible to novices while still powerful enough to meet the demands of an expert practitioner. The programs run on all major computer platforms and are freely available under the terms of a free software license.},
  doi      = {https://doi.org/10.1107/S0909049505012719},
  eprint   = {https://onlinelibrary.wiley.com/doi/pdf/10.1107/S0909049505012719},
  keywords = {XAS, data analysis, FEFF, IFEFFIT.},
  url      = {https://onlinelibrary.wiley.com/doi/abs/10.1107/S0909049505012719},
}

@Article{ms-speech-recognition-paper,
  author    = {Hinton, Geoffrey and Deng, Li and Yu, Dong and Dahl, George E and Mohamed, Abdel-rahman and Jaitly, Navdeep and Senior, Andrew and Vanhoucke, Vincent and Nguyen, Patrick and Sainath, Tara N and others},
  journal   = {IEEE Signal processing magazine},
  title     = {Deep neural networks for acoustic modeling in speech recognition: The shared views of four research groups},
  year      = {2012},
  number    = {6},
  pages     = {82--97},
  volume    = {29},
  publisher = {IEEE},
}

@Article{,
}

@Article{,
}

@Article{,
}

@Article{huawei-meta-sgd,
  author  = {Zhou, Fengwei and Wu, Bin and Li, Zhenguo},
  journal = {arXiv preprint arXiv:1802.03596},
  title   = {Deep meta-learning: Learning to learn in the concept space},
  year    = {2018},
}

@Comment{jabref-meta: databaseType:bibtex;}

branch_name: refs/heads/main

extension: bib


text:
@article{pmid29900096,
 abstract = {The mitochondrial human proteome project (mt-HPP) was initiated by the Italian HPP group as a part of both the chromosome-centric initiative (C-HPP) and the ⿿biology and disease driven⿿ initiative (B/D-HPP). In recent years several reports highlighted how mitochondrial biology and disease are regulated by specific interactions with non-mitochondrial proteins. Thus, it is of great relevance to extend our present view of the mitochondrial proteome not only to those proteins that are encoded by or transported to mitochondria, but also to their interactors that take part in mitochondria functionality. Here, we propose a graphical representation of the functional mitochondrial proteome by retrieving mitochondrial proteins from the NeXtProt database and adding to the network their interactors as annotated in the IntAct database. Notably, the network may represent a reference to map all the proteins that are currently being identified in mitochondrial proteomics studies.},
 author = {Mauro Fasano and Tiziana Alberio and Mohan Babu and Emma Lundberg and Andrea Urbani},
 doi = {10.1016/j.euprot.2016.01.004},
 journal = {EuPA Open Proteom},
 month = {March},
 nlmuniqueid = {101637351},
 pages = {24-27},
 pii = {S2212-9685(16)30004-6},
 pmc = {PMC5988588},
 pubmed = {29900096},
 title = {Towards a functional definition of the mitochondrial human proteome.},
 volume = {10},
 year = {2016}
}

repository: zqzneptune/BabuLab

repo_name: zqzneptune/BabuLab