Stop the war!Остановите войну!
for scientists:
Google
Google Scholar
Semantic Scholar
IA Scholar
CiteSeerX
ORCIDMorteza Haghir Chehreghani
Person information
- affiliation: Chalmers University of Technology, Sweden
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c27]Fazeleh Sadat Hoseini, Morteza Haghir Chehreghani:
Memory-Efficient Minimax Distance Measures. PAKDD (1) 2022: 419-431- [i27]Balázs Varga, Balázs Kulcsár, Morteza Haghir Chehreghani:
Deep Q-learning: a robust control approach. CoRR abs/2201.08610 (2022) - [i26]Federica Comuni, Christopher Mészáros, Niklas Åkerblom, Morteza Haghir Chehreghani:
Passive and Active Learning of Driver Behavior from Electric Vehicles. CoRR abs/2203.02179 (2022) - [i25]Fazeleh Sadat Hoseini, Niklas Åkerblom, Morteza Haghir Chehreghani:
A Contextual Combinatorial Semi-Bandit Approach to Network Bottleneck Identification. CoRR abs/2206.08144 (2022) - 2021
- [c26]John Daniel Bossér, Erik Sörstadius, Morteza Haghir Chehreghani:
Model-Centric and Data-Centric Aspects of Active Learning for Deep Neural Networks. IEEE BigData 2021: 5053-5062 - [c25]Masoud Malek, Mostafa Haghir Chehreghani, Ehsan Nazerfard, Morteza Haghir Chehreghani:
Shallow Node Representation Learning using Centrality Indices. IEEE BigData 2021: 5209-5214 - [c24]Morteza Haghir Chehreghani:
Reliable Agglomerative Clustering. IJCNN 2021: 1-8 - [c23]Fazeleh Sadat Hoseini, Sadegh Rahrovani, Morteza Haghir Chehreghani:
Vehicle Motion Trajectories Clustering via Embedding Transitive Relations. ITSC 2021: 1314-1321 - [i24]Victor Eberstein, Jonas Sjöblom, Nikolce Murgovski, Morteza Haghir Chehreghani:
A Unified Framework for Online Trip Destination Prediction. CoRR abs/2101.04520 (2021) - [i23]Balázs Varga, Balázs Kulcsár, Morteza Haghir Chehreghani:
Constrained Policy Gradient Method for Safe and Fast Reinforcement Learning: a Neural Tangent Kernel Based Approach. CoRR abs/2107.09139 (2021) - [i22]Sanna Jarl, Sadegh Rahrovani, Morteza Haghir Chehreghani:
Analysis of Driving Scenario Trajectories with Active Learning. CoRR abs/2108.03217 (2021) - [i21]Niklas Åkerblom, Fazeleh Sadat Hoseini, Morteza Haghir Chehreghani:
Online Learning of Network Bottlenecks via Minimax Paths. CoRR abs/2109.08467 (2021) - [i20]Morteza Haghir Chehreghani:
Shift of Pairwise Similarities for Data Clustering. CoRR abs/2110.13103 (2021) - [i19]Niklas Åkerblom, Yuxin Chen, Morteza Haghir Chehreghani:
Online Learning of Energy Consumption for Navigation of Electric Vehicles. CoRR abs/2111.02314 (2021) - 2020
- [j11]Morteza Haghir Chehreghani
, Mostafa Haghir Chehreghani:
Learning representations from dendrograms. Mach. Learn. 109(9-10): 1779-1802 (2020) - [j10]Morteza Haghir Chehreghani:
Unsupervised representation learning with Minimax distance measures. Mach. Learn. 109(11): 2063-2097 (2020) - [j9]Ashkan Panahi, Morteza Haghir Chehreghani, Devdatt P. Dubhashi:
Accelerated proximal incremental algorithm schemes for non-strongly convex functions. Theor. Comput. Sci. 812: 203-213 (2020) - [c22]Niklas Åkerblom, Yuxin Chen, Morteza Haghir Chehreghani:
An Online Learning Framework for Energy-Efficient Navigation of Electric Vehicles. IJCAI 2020: 2051-2057 - [c21]Andreas Demetriou, Henrik Allsvåg, Sadegh Rahrovani, Morteza Haghir Chehreghani:
Generation of Driving Scenario Trajectories with Generative Adversarial Networks. ITSC 2020: 1-6 - [i18]Morteza Haghir Chehreghani:
Hierarchical Correlation Clustering and Tree Preserving Embedding. CoRR abs/2002.07756 (2020) - [i17]Niklas Åkerblom, Yuxin Chen, Morteza Haghir Chehreghani:
An Online Learning Framework for Energy-Efficient Navigation of Electric Vehicles. CoRR abs/2003.01416 (2020) - [i16]Ali Samadzadeh, Fatemeh Sadat Tabatabaei Far, Ali Javadi, Ahmad Nickabadi, Morteza Haghir Chehreghani:
Convolutional Spiking Neural Networks for Spatio-Temporal Feature Extraction. CoRR abs/2003.12346 (2020) - [i15]Arman Rahbar, Ashkan Panahi, Chiranjib Bhattacharyya, Devdatt P. Dubhashi, Morteza Haghir Chehreghani:
On the Unreasonable Effectiveness of Knowledge Distillation: Analysis in the Kernel Regime. CoRR abs/2003.13438 (2020) - [i14]Fazeleh Sadat Hoseini, Morteza Haghir Chehreghani:
Memory-Efficient Sampling for Minimax Distance Measures. CoRR abs/2005.12627 (2020) - [i13]Carl Johnell, Morteza Haghir Chehreghani:
Frank-Wolfe Optimization for Dominant Set Clustering. CoRR abs/2007.11652 (2020) - [i12]Andreas Demetriou, Henrik Alfsvåg, Sadegh Rahrovani, Morteza Haghir Chehreghani:
A Deep Learning Framework for Generation and Analysis of Driving Scenario Trajectories. CoRR abs/2007.14524 (2020) - [i11]John Daniel Bossér, Erik Sörstadius, Morteza Haghir Chehreghani:
Model-Centric and Data-Centric Aspects of Active Learning for Neural Network Models. CoRR abs/2009.10835 (2020) - [i10]Fazeleh Sadat Hoseini, Sadegh Rahrovani, Morteza Haghir Chehreghani:
A Generic Framework for Clustering Vehicle Motion Trajectories. CoRR abs/2009.12443 (2020)
2010 – 2019
- 2019
- [c20]Erik Thiel, Morteza Haghir Chehreghani, Devdatt P. Dubhashi:
A Non-Convex Optimization Approach to Correlation Clustering. AAAI 2019: 5159-5166 - [c19]Claes Strannegård, Herman Carlström, Niklas Engsner, Fredrik Mäkeläinen, Filip Slottner Seholm, Morteza Haghir Chehreghani:
Lifelong Learning Starting from Zero. AGI 2019: 188-197 - [i9]Morteza Haghir Chehreghani:
Reliable Agglomerative Clustering. CoRR abs/1901.02063 (2019) - [i8]Ashkan Panahi, Erik Thiel, Morteza Haghir Cheraghani, Devdatt P. Dubhashi:
Stochastic Incremental Algorithms for Optimal Transport with SON Regularizer. CoRR abs/1903.03850 (2019) - [i7]Morteza Haghir Chehreghani:
Nonparametric feature extraction based on Minimax distance. CoRR abs/1904.13223 (2019) - [i6]Emilio Jorge, Morteza Haghir Chehreghani, Devdatt P. Dubhashi:
Spectral Analysis of Kernel and Neural Embeddings: Optimization and Generalization. CoRR abs/1905.05095 (2019) - [i5]Claes Strannegård, Herman Carlström, Niklas Engsner, Fredrik Mäkeläinen, Filip Slottner Seholm, Morteza Haghir Chehreghani:
Lifelong Learning Starting From Zero. CoRR abs/1906.09852 (2019) - 2018
- [c18]Mostafa Haghir Chehreghani, Morteza Haghir Chehreghani:
Efficient Context-Aware K-Nearest Neighbor Search. ECIR 2018: 466-478 - [i4]Morteza Haghir Chehreghani, Mostafa Haghir Chehreghani:
Nonparametric Feature Extraction from Dendrograms. CoRR abs/1812.09225 (2018) - [i3]Yuxin Chen, Morteza Haghir Chehreghani:
Trip Prediction by Leveraging Trip Histories from Neighboring Users. CoRR abs/1812.10097 (2018) - 2017
- [c17]Morteza Haghir Chehreghani:
Classification with Minimax Distance Measures. AAAI 2017: 1784-1790 - [c16]Morteza Haghir Chehreghani:
Feature-Oriented Analysis of User Profile Completion Problem. ECIR 2017: 304-316 - [c15]Morteza Haghir Chehreghani:
Clustering by Shift. ICDM 2017: 793-798 - [c14]Morteza Haghir Chehreghani:
Efficient Computation of Pairwise Minimax Distance Measures. ICDM 2017: 799-804 - [c13]Yuxin Chen, Jean-Michel Renders, Morteza Haghir Chehreghani, Andreas Krause:
Efficient Online Learning for Optimizing Value of Information: Theory and Application to Interactive Troubleshooting. UAI 2017 - [i2]Yuxin Chen, Jean-Michel Renders, Morteza Haghir Chehreghani, Andreas Krause:
Efficient Online Learning for Optimizing Value of Information: Theory and Application to Interactive Troubleshooting. CoRR abs/1703.05452 (2017) - 2016
- [j8]Morteza Haghir Chehreghani:
Adaptive trajectory analysis of replicator dynamics for data clustering. Mach. Learn. 104(2-3): 271-289 (2016) - [c12]Mostafa Haghir Chehreghani, Morteza Haghir Chehreghani:
Transactional Tree Mining. ECML/PKDD (1) 2016: 182-198 - [c11]Morteza Haghir Chehreghani:
K-Nearest Neighbor Search and Outlier Detection via Minimax Distances. SDM 2016: 405-413 - [c10]Morteza Haghir Chehreghani, Mostafa Haghir Chehreghani:
Modeling Transitivity in Complex Networks. UAI 2016 - 2014
- [i1]Morteza Haghir Chehreghani, Mostafa Haghir Chehreghani:
Modeling Transitivity in Complex Networks. CoRR abs/1411.0958 (2014) - 2013
- [c9]Ludwig M. Busse, Morteza Haghir Chehreghani, Joachim M. Buhmann:
Approximate Sorting. GCPR 2013: 142-152 - 2012
- [j7]Morteza Haghir Chehreghani, Mostafa Haghir Chehreghani, Hassan Abolhassani:
Probabilistic Heuristics for Hierarchical Web Data Clustering. Comput. Intell. 28(2): 209-233 (2012) - [c8]Ludwig M. Busse, Morteza Haghir Chehreghani, Joachim M. Buhmann:
The information content in sorting algorithms. ISIT 2012: 2746-2750 - [c7]Joachim M. Buhmann, Morteza Haghir Chehreghani, Mario Frank, Andreas P. Streich:
Information Theoretic Model Selection for Pattern Analysis. ICML Unsupervised and Transfer Learning 2012: 51-64 - [c6]Morteza Haghir Chehreghani, Alberto Giovanni Busetto, Joachim M. Buhmann:
Information Theoretic Model Validation for Spectral Clustering. AISTATS 2012: 495-503 - 2011
- [j6]Mostafa Haghir Chehreghani, Morteza Haghir Chehreghani, Caro Lucas, Masoud Rahgozar:
OInduced: An Efficient Algorithm for Mining Induced Patterns From Rooted Ordered Trees. IEEE Trans. Syst. Man Cybern. Part A 41(5): 1013-1025 (2011) - [c5]Mario Frank, Morteza Haghir Chehreghani, Joachim M. Buhmann:
The Minimum Transfer Cost Principle for Model-Order Selection. ECML/PKDD (1) 2011: 423-438
2000 – 2009
- 2009
- [j5]Morteza Haghir Chehreghani, Hassan Abolhassani, Mostafa Haghir Chehreghani:
Density link-based methods for clustering web pages. Decis. Support Syst. 47(4): 374-382 (2009) - [j4]Mostafa Haghir Chehreghani, Morteza Haghir Chehreghani, Caro Lucas, Masoud Rahgozar, Euhanna Ghadimi:
Efficient rule based structural algorithms for classification of tree structured data. Intell. Data Anal. 13(1): 165-188 (2009) - 2008
- [j3]Mehrdad Mahdavi, Morteza Haghir Chehreghani, Hassan Abolhassani, Rana Forsati:
Novel meta-heuristic algorithms for clustering web documents. Appl. Math. Comput. 201(1-2): 441-451 (2008) - [j2]Morteza Haghir Chehreghani, Hassan Abolhassani, Mostafa Haghir Chehreghani:
Improving density-based methods for hierarchical clustering of web pages. Data Knowl. Eng. 67(1): 30-50 (2008) - 2007
- [j1]Mostafa Haghir Chehreghani, Masoud Rahgozar, Caro Lucas, Morteza Haghir Chehreghani:
A heuristic algorithm for clustering rooted ordered trees. Intell. Data Anal. 11(4): 355-376 (2007) - [c4]Morteza Haghir Chehreghani, Hassan Abolhassani:
H-BayesClust: A New Hierarchical Clustering Based on Bayesian Networks. ADMA 2007: 616-624 - [c3]Mostafa Haghir Chehreghani, Masoud Rahgozar, Caro Lucas, Morteza Haghir Chehreghani:
Mining Maximal Embedded Unordered Tree Patterns. CIDM 2007: 437-443 - [c2]Mostafa Haghir Chehreghani, Masoud Rahgozar, Caro Lucas, Morteza Haghir Chehreghani:
Clustering Rooted Ordered Trees. CIDM 2007: 450-455 - [c1]Morteza Haghir Chehreghani, Hassan Abolhassani, Mostafa Haghir Chehreghani:
Attaining Higher Quality for Density Based Algorithms. RR 2007: 329-338
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2022-06-25 02:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp has been originally created in 1993 at:
since 2018, dblp is operated and maintained by:
the dblp computer science bibliography is funded and supported by:
