[Talk Summary 8] Data-Driven Science of Science

Dr. Ying Ding from School of Informatics and Computing, Indiana University gave the talk "Data-Driven Science of Science" on November, 04, 2016 at School of Information Science, University of Pittsburgh.

In the talk. Dr. Ding presented an overview about Data Science and the current layers of bibliometrics, which are macro level in complex network, meso level in bibliometrics, and micro level in collaboration and team science. Currently, most of research work has been focusing on analyzing data from complex network and bibliometrics. Dr. Ding suggested that collaboration and team science, as a micro level, should be a new trend to have the attention of data scientists.

In addition, Dr. Ding concisely summarized her work related to Data Science which is beyond the bibliometrics. The three following are the main of her research:
  • Data-Driven Discovery: entity metrics, computational hypothesis generation, and digital innovation (e.g. machine reading)
  • Data-Driven Decision Making: understanding scientific career, understanding scientific collaboration, and understanding scientific success and innovation.
  • Data-Driven Knowledge Discovery
In details, she stated some potential, interesting ideas and techniques related to her work. Speaking of keywords, how does a keyword shift from one topic to another topic (or one domain to another domain). How can we increase the strength of relationship between two nodes in a graph in a far distance? Figuring out those kinds of relationship helps us to discover the knowledge which is difficult to be known. In her research, she tried to find patterns in the graph through extracting the same sub-structure of two entities, the semantic relationship, and the gene ontology.

At the end of the talk, Dr. Ding discussed a new potential topic in machine learning, lifelong machine learning. Lifelong learning which learns as humans retains the knowledge gained from the past learning and uses the knowledge to help future learning and problem solving.

11/04/2016
135N Bellefield, IS building
University of Pittsburgh

Comments

Post a Comment

Popular posts from this blog

Influences on Query Reformalution in Collaborative Web Search

Zhen Yue, Shuguang Han, Daqing He, and Jiepu Jiang ( Computer-2014 ) http://ieeexplore.ieee.org/abstract/document/6766167/ In the paper “Influences on Query Reformation in Collaborative Web Search”, Yue et al. investigate a study to analyze the influences of collaboration between members in a group for information seeking. They are motivated to study (1) the influence of collaboration on search query formulation and reformulation; (2) similarities and differences exist in terms of query reformulation for collaborative searches compared with individual searches; and (3) the nature of the query task influence query reformulation in collaborative information seeking (CIS). In order to run the study, Yue et al. used CollabSearch, a Web search system developed by their group for collaborative users. The system includes three frames: a topic statement page which shows the description about the search task a group want to conduct; a web search page which displays Google search results...
Read more

Personalized Access to Scientific Publications: from Recommendation to Explanation

Dario De Nart, Felice Ferrara, and Carlo Tasso ( UMAP-2013 ) http://link.springer.com/chapter/10.1007/978-3-642-38844-6_26 In the paper “Personalized Access to Scientific Publications: from Recommendation to Explanation”, Dario De Nart et al. present a Recommender and Explanation System (RES) that is able to recommend scientific publication and show explanation to users.  In order to do recommendation, Dario De Nart et al., firstly, use the The Dikpe Keyphrase extraction algorithm introduced by Pudota (2010) to extract keyphrases from papers. Each keyphrase has a weight called keyphraseness that reveals the several lexical and statistical indicators exploited in the extraction process. Higher is the keyphraseness, more relevant is the KP. For each paper in the collection, they represent it as a conceptual graph. Each node in the graph is a term broken down from a KP. Two nodes are connected when they appear in the same KP. For instance, the KP “document retrieval” is split int...
Read more

SoRec: Social Recommendation Using Probabilistic Matrix Factorization

Hao Ma, Haixuan Yang, Michael R. Lyu, Irwin King ( CIKM-08 ) http://dl.acm.org/citation.cfm?id=1458205 In this paper, Hao Ma et al. present an approach that help to deal with very large datasets and users who have made few ratings in recommender systems. Traditional methods (e.g., Pearson Correlation Coefficient and Cosine) assume that two users have rated at least some items in common so that they can compute the similarity of these users. Thus, memory-based and model-based collaborative filtering algorithms fail to find similarities of users who have never rated any items. In daily life, people usually ask their family or friends for recommendations of new movies, songs, books, restaurants or places to visit. Therefore, the authors propose a factor analysis approach based on probabilistic matrix factorization to solve the data sparsity and poor prediction accuracy problems by employing both users’ social network information and rating records. Different with traditional persp...
Read more