NDLI: How Does Research Evolve? Pattern Mining for Research Meme Cycles

Content Provider	IEEE Xplore Digital Library
Author	Dan He Xingquan Zhu Parker, D.S.
Copyright Year	2011
Abstract	Recent years have witnessed a great deal of attention in tracking news memes over the web, modeling shifts in the ebb and flow of their popularity. One of the most important features of news memes is that they seldom occur repeatedly, instead, they tend to shift to different but similar memes. In this work, we consider patterns in research memes, which differ significantly from news memes and have received very little attention. One significant difference between research memes and news memes lies in that research memes have cyclic development, motivating the need for models of cycles of research memes. Furthermore, these cycles may reveal important patterns of evolving research, shedding lights on how research progresses. In this paper, we formulate the modeling of the cycles of research memes, and propose solutions to the problem of identifying cycles and discovering patterns among these cycles. Experiments on two different domain applications indicate that our model does find meaningful patterns and our algorithms for pattern discovery are efficient for large scale data analysis.
Starting Page	1068
Ending Page	1073
File Size	579711
Page Count	6
File Format	PDF
ISBN	9781457720758
ISSN	15504786
DOI	10.1109/ICDM.2011.76
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2011-12-11
Publisher Place	Canada
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Computer science Computational modeling Heuristic algorithms Complexity theory Data mining Social network services Ontologies topic evolution Research memes frequent patterns MeSH hierarchy shortest paths topic mining
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Broadcasting Algorithm Via Shortest Paths

A Forward-Backward Single-Source Shortest Paths Algorithm

Modeling semantic influence for biomedicai research topics using MeSH hierarchy

Dynamic shortest path algorithms for hypergraphs

All-Pairs Almost Shortest Paths

Incremental algorithm for updating betweenness centrality in dynamically growing networks

On compressing frequent patterns ⋆.

On compressing frequent patterns (2007).

A share strategy for utility frequent patterns mining

How Does Research Evolve? Pattern Mining for Research Meme Cycles

Similar Documents

Broadcasting Algorithm Via Shortest Paths

A Forward-Backward Single-Source Shortest Paths Algorithm

Modeling semantic influence for biomedicai research topics using MeSH hierarchy

Dynamic shortest path algorithms for hypergraphs

All-Pairs Almost Shortest Paths

Incremental algorithm for updating betweenness centrality in dynamically growing networks

On compressing frequent patterns ⋆.

On compressing frequent patterns (2007).

A share strategy for utility frequent patterns mining

How Does Research Evolve? Pattern Mining for Research Meme Cycles