3 Result(s)
within
Sarang Kapoor
Computer Science
-
Chapter and Conference Paper
On Timing the Nadir-Point Estimation and/or Termination of Reference-Based Multi- and Many-objective Evolutionary Algorithms
There is considerable evidence that the Multi- and Many-objective Evolutionary Algorithms (jointly referred as MâOEAs, here) are mostly run for arbitrarily fixed number of generations. The absence of any justi...
-
Article
Discovering subjectively interesting multigraph patterns
Over the past decade, network analysis has attracted substantial interest because of its potential to solve many real-world problems. This paper lays the conceptual foundation for an application in aviation, t...
-
Article
Open AccessOnline summarization of dynamic graphs using subjective interestingness for sequential data
Many real-world phenomena can be represented as dynamic graphs, i.e., networks that change over time. The problem of dynamic graph summarization, i.e., to succinctly describe the evolution of a dynamic graph, ...
