# Mitsunori Ogihara

According to our database

Collaborative distances:

^{1}, Mitsunori Ogihara authored at least 186 papers between 1990 and 2018.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepage:

#### On csauthors.net:

## Bibliography

2018

Fundamentals of Java Programming

Springer, ISBN: 978-3-319-89490-4, 2018

2017

Computational complexity studies of synchronous Boolean finite dynamical systems on directed graphs.

Inf. Comput., 2017

Multimodal Content Analysis for Effective Advertisements on YouTube.

CoRR, 2017

Generalized Predecessor Existence Problems for Boolean Finite Dynamical Systems.

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Student Retention Pattern Prediction Employing Linguistic Features Extracted from Admission Application Essays.

Proceedings of the 16th IEEE International Conference on Machine Learning and Applications, 2017

Multimodal Content Analysis for Effective Advertisements on YouTube.

Proceedings of the 2017 IEEE International Conference on Data Mining, 2017

2016

Sequential Pattern Based Temporal Contour Representations for Content-Based Multimedia Timeline Analysis.

Proceedings of the 15th IEEE International Conference on Machine Learning and Applications, 2016

2015

Mining library and university data to understand library use patterns.

The Electronic Library, 2015

Computational Complexity Studies of Synchronous Boolean Finite Dynamical Systems.

Proceedings of the Theory and Applications of Models of Computation, 2015

Finding trendy products from pins.

Proceedings of the 9th IEEE International Conference on Semantic Computing, 2015

Analysis of the Evolution of Research Groups and Topics in the ISMIR Conference.

Proceedings of the 16th International Society for Music Information Retrieval Conference, 2015

2014

Guest Editorial: Special Section on Music Data Mining.

IEEE Trans. Multimedia, 2014

2013

Theory and Applications of Models of Computation 2011.

Theor. Comput. Sci., 2013

Evaluation on Feature Importance for Favorite Song Detection.

Proceedings of the 14th International Society for Music Information Retrieval Conference, 2013

Cuban Theater Digital Archive: A Multimodal Platform for Theater Documentation and Research.

Proceedings of the Information Technologies for Performing Arts, Media Access, and Entertainment, 2013

2012

Hierarchical Co-Clustering: A New Way to Organize the Music Data.

IEEE Trans. Multimedia, 2012

Gestural cue analysis in automated semantic miscommunication annotation.

Multimedia Tools Appl., 2012

A model for multi-label classification and ranking of learning objects.

Expert Syst. Appl., 2012

Summarizing the differences from microblogs.

Proceedings of the 35th International ACM SIGIR conference on research and development in Information Retrieval, 2012

Genre classification for million song dataset using confidence-based classifiers combination.

Proceedings of the 35th International ACM SIGIR conference on research and development in Information Retrieval, 2012

Combining Gene Expression Profiles and Protein-Protein Interactions for Identifying Functional Modules.

Proceedings of the 11th International Conference on Machine Learning and Applications, 2012

Identifying Accuracy of Social Tags by Using Clustering Representations of Song Lyrics.

Proceedings of the 11th International Conference on Machine Learning and Applications, 2012

Generating Pictorial Storylines Via Minimum-Weight Connected Dominating Set Approximation in Multi-View Graphs.

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011

Potential Relationship Discovery in Tag-Aware Music Style Clustering and Artist Social Networks.

Proceedings of the 12th International Society for Music Information Retrieval Conference, 2011

NextOne Player: A Music Recommendation System Based on User Behavior.

Proceedings of the 12th International Society for Music Information Retrieval Conference, 2011

Learning Condition-Dependent Dynamical PPI Networks from Conflict-Sensitive Phosphorylation Dynamics.

Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2011

Inferring conflict-sensitive phosphorylation dynamics.

Proceedings of the ACM International Conference on Bioinformatics, 2011

2010

Analysis of Chord Progression Data.

Proceedings of the Advances in Music Information Retrieval, 2010

Wavelet Methods in Data Mining.

Proceedings of the Data Mining and Knowledge Discovery Handbook, 2nd ed., 2010

Time and Space Complexity for Splicing Systems.

Theory Comput. Syst., 2010

On the Autoreducibility of Functions.

Theory Comput. Syst., 2010

On combining multiple clusterings: an overview and a new perspective.

Appl. Intell., 2010

Are Tags Better Than Audio? The Effect of Joint Use of Tags and Audio Content Features for Artistic Style Clustering.

Proceedings of the 11th International Society for Music Information Retrieval Conference, 2010

Hierarchical Co-Clustering of Artists and Tags.

Proceedings of the 11th International Society for Music Information Retrieval Conference, 2010

Fixed-Parameter Tractable Combinatorial Algorithms for Metabolic Networks Alignments.

Proceedings of the ICDMW 2010, 2010

Global iceberg detection over distributed data streams.

Proceedings of the 26th International Conference on Data Engineering, 2010

WS-GraphMatching: a web service tool for graph matching.

Proceedings of the 19th ACM Conference on Information and Knowledge Management, 2010

2009

Music Clustering With Features From Different Information Sources.

IEEE Trans. Multimedia, 2009

Music Recommendation Based on Acoustic Features and User Access Patterns.

IEEE Trans. Audio, Speech & Language Processing, 2009

Mining product reviews based on shallow dependency parsing.

Proceedings of the 32nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2009

Tag Integrated Multi-Label Music Style Classification with Hypergraph.

Proceedings of the 10th International Society for Music Information Retrieval Conference, 2009

An Efficient Algorithm for Measuring Medium- to Large-Sized Flows in Network Traffic.

Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

2008

Text categorization via generalized discriminant analysis.

Inf. Process. Manage., 2008

Quantify music artist similarity based on style and mood.

Proceedings of the 10th ACM International Workshop on Web Information and Data Management (WIDM 2008), 2008

N-Gram Chord Profiles for Composer Style Representation.

Proceedings of the ISMIR 2008, 2008

2007

Complexity theory for splicing systems.

Theor. Comput. Sci., 2007

Hierarchical document classification using automatically generated hierarchy.

J. Intell. Inf. Syst., 2007

Autoreducibility, mitoticity, and immunity.

J. Comput. Syst. Sci., 2007

Keyword Generation for Lyrics.

Proceedings of the 8th International Conference on Music Information Retrieval, 2007

Music Clustering with Constraints.

Proceedings of the 8th International Conference on Music Information Retrieval, 2007

A data streaming algorithm for estimating entropies of od flows.

Proceedings of the 7th ACM SIGCOMM Internet Measurement Conference, 2007

Analysis of input-dependent program behavior using active profiling.

Proceedings of the Workshop on Experimental Computer Science, 2007

Complexity Theory for Splicing Systems.

Proceedings of the Developments in Language Theory, 11th International Conference, 2007

2006

Molecular Computation.

Proceedings of the Recent Advances in Formal Languages and Applications, 2006

Toward intelligent music information retrieval.

IEEE Trans. Multimedia, 2006

The Complexity of Finding Top-Toda-Equivalence-Class Members.

Theory Comput. Syst., 2006

Using discriminant analysis for multi-class classification: an experimental investigation.

Knowl. Inf. Syst., 2006

Data streaming algorithms for estimating entropy of network traffic.

Proceedings of the Joint International Conference on Measurement and Modeling of Computer Systems, 2006

A hierarchical model of data locality.

Proceedings of the 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2006

Finding global icebergs over distributed data sets.

Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2006

Very Sparse Leaf Languages.

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

Program-level adaptive memory management.

Proceedings of the 5th International Symposium on Memory Management, 2006

Integrating Features from Different Sources for Music Information Retrieval.

Proceedings of the 6th IEEE International Conference on Data Mining (ICDM 2006), 2006

2005

The enumerability of P collapses P to NC.

Theor. Comput. Sci., 2005

Semisupervised learning from different information sources.

Knowl. Inf. Syst., 2005

Competing provers yield improved Karp-Lipton collapse results.

Inf. Comput., 2005

Autoreducibility, Mitoticity, and Immunity

Electronic Colloquium on Computational Complexity (ECCC), 2005

Autoreducibility, Mitoticity, and Immunity.

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

Separating the Notions of Self- and Autoreducibility.

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

Music genre classification with taxonomy.

Proceedings of the 2005 IEEE International Conference on Acoustics, 2005

Gated memory control for memory monitoring, leak detection and garbage collection.

Proceedings of the 2005 workshop on Memory System Performance, 2005

Wavelet Methods in Data Mining.

Proceedings of the Data Mining and Knowledge Discovery Handbook., 2005

2004

On the reducibility of sets inside NP to sets with low information content.

J. Comput. Syst. Sci., 2004

A comparative study of feature selection and multiclass classification methods for tissue classification based on gene expression.

Bioinformatics, 2004

Document clustering via adaptive subspace iteration.

Proceedings of the SIGIR 2004: Proceedings of the 27th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2004

Music artist style identification by semi-supervised learning from both lyrics and content.

Proceedings of the 12th ACM International Conference on Multimedia, 2004

The Enumerability of P Collapses P to NC.

Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

The Complexity of Finding Top-Toda-Equivalence-Class Members.

Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Entropy-based criterion in categorical clustering.

Proceedings of the Machine Learning, 2004

Content-based music similarity search and emotion detection.

Proceedings of the 2004 IEEE International Conference on Acoustics, 2004

On combining multiple clusterings.

Proceedings of the 2004 ACM CIKM International Conference on Information and Knowledge Management, 2004

Semi-supervised learning for music artists style identification.

Proceedings of the 2004 ACM CIKM International Conference on Information and Knowledge Management, 2004

2003

The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes.

Theor. Comput. Sci., 2003

A Note on Square Rooting of Time Functions of Turing Machines.

Theory Comput. Syst., 2003

The (Non)Enumerability of the Determinant and the Rank.

Theory Comput. Syst., 2003

Algorithms for clustering high dimensional and distributed data.

Intell. Data Anal., 2003

Association-based similarity testing and its applications.

Intell. Data Anal., 2003

Prediction of biologically significant components from microarray data: Independently Consistent Expression Discriminator (ICED).

Bioinformatics, 2003

Competing Provers Yield Improved Karp-Lipton Collapse Results.

Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

Topic hierarchy generation via linear discriminant projection.

Proceedings of the SIGIR 2003: Proceedings of the 26th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, July 28, 2003

A comparative study on content-based music genre classification.

Proceedings of the SIGIR 2003: Proceedings of the 26th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, July 28, 2003

A New Distributed Data Mining Model Based on Similarity.

Proceedings of the 2003 ACM Symposium on Applied Computing (SAC), 2003

Gene Functional Classification by Semisupervised Learning from Heterogeneous Data.

Proceedings of the 2003 ACM Symposium on Applied Computing (SAC), 2003

Detecting emotion in music.

Proceedings of the ISMIR 2003, 2003

Using Discriminant Analysis for Multi-class Classification.

Proceedings of the 3rd IEEE International Conference on Data Mining (ICDM 2003), 2003

Efficient multi-way text categorization via generalized discriminant analysis.

Proceedings of the 2003 ACM CIKM International Conference on Information and Knowledge Management, 2003

2002

The Complexity Theory Companion

Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-662-04880-1, 2002

A Survey on Wavelet Applications in Data Mining.

SIGKDD Explorations, 2002

Guest Editors' Foreword.

Theory Comput. Syst., 2002

Reducing the Number of Solutions of NP Functions.

J. Comput. Syst. Sci., 2002

On the Enumerability of the Determinant and the Rank

Electronic Colloquium on Computational Complexity (ECCC), 2002

The Minimum-Model DNA Computation on a Sequence of Probe Arrays.

Proceedings of the Unconventional Models of Computation, Third International Conference, 2002

On the Enumerability of the Determinant and the Rank.

Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

CoFD : An Algorithm for Non-distance Based Clustering in High Dimensional Spaces.

Proceedings of the Data Warehousing and Knowledge Discovery, 4th International Conference, 2002

Estimating Joint Probabilities from Marginal Ones.

Proceedings of the Data Warehousing and Knowledge Discovery, 4th International Conference, 2002

2001

Review of "DNA based computers V" by Eric Winfree and David K. Gifford. American Mathematics Society.

SIGACT News, 2001

The complexity theory companion.

SIGACT News, 2001

Parallel Data Mining for Association Rules on Shared-Memory Systems.

Knowl. Inf. Syst., 2001

The Complexity of Computing the Number of Self-Avoiding Walks in Two-Dimensional Grid Graphs and in Hypercube Graphs

Electronic Colloquium on Computational Complexity (ECCC), 2001

The Complexity of Computing the Number of Self-Avoiding Walks in Two-Dimensional Grid Graphs and in Hypercube Graphs.

Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

2000

Erratum to "Reducibility classes of P-selective sets".

Theor. Comput. Sci., 2000

Tally NP Sets and Easy Census Functions.

Inf. Comput., 2000

Scalable Feature Mining for Sequential Data.

IEEE Intelligent Systems, 2000

PlanMine: Predicting Plan Failures Using Sequence Mining.

Artif. Intell. Rev., 2000

Clustering Distributed Homogeneous Datasets.

Proceedings of the Principles of Data Mining and Knowledge Discovery, 2000

Reducing the Number of Solutions of NP Functions.

Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

Exploiting Dataset Similarity for Distributed Mining.

Proceedings of the Parallel and Distributed Processing, 2000

A DNA-Based Random Walk Method for Solving k-SAT.

Proceedings of the DNA Computing, 6th International Workshop on DNA-Based Computers, 2000

1999

Review of DNA Based Computers II edited by Laura F. Landweber and Eric K. Baum.

SIGACT News, 1999

The Complexity of Matrix Rank and Feasible Systems of Linear Equations.

Computational Complexity, 1999

Simulating Boolean Circuits on a DNA Computer.

Algorithmica, 1999

Active Mining in a Distributed Setting.

Proceedings of the Large-Scale Parallel Data Mining, 1999

Mining Features for Sequence Classification.

Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 1999

Incremental and Interactive Sequence Mining.

Proceedings of the 1999 ACM CIKM International Conference on Information and Knowledge Management, 1999

1998

Properties of Probabilistic Pushdown Automata.

Theor. Comput. Sci., 1998

The PL Hierarchy Collapses.

SIAM J. Comput., 1998

Tally NP Sets and Easy Census Functions

CoRR, 1998

Tally NP Sets and Easy Census Functions.

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

PlanMine: Sequence Mining for Plan Failures.

Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining (KDD-98), 1998

1997

Oracles that Compute Values.

SIAM J. Comput., 1997

Universally Serializable Computation.

J. Comput. Syst. Sci., 1997

Parallel Algorithms for Discovery of Association Rules.

Data Min. Knowl. Discov., 1997

Evaluation of Sampling for Data Mining of Association Rules.

Proceedings of the 7th International Workshop on Research Issues in Data Engineering (RIDE '97) High Performance Database Management for Large-Scale Applications, 1997

Simulating Boolean circuits on a DNA computer.

Proceedings of the First Annual International Conference on Research in Computational Molecular Biology, 1997

New Algorithms for Fast Discovery of Association Rules.

Proceedings of the Third International Conference on Knowledge Discovery and Data Mining (KDD-97), 1997

DNA-based parallel computation by "counting".

Proceedings of the DNA Based Computers, 1997

Sparse Hard Sets for P.

Proceedings of the Advances in Algorithms, Languages, and Complexity, 1997

1996

Reducibility Classes of P-Selective Sets.

Theor. Comput. Sci., 1996

Computing Solutions Uniquely Collapses the Polynomial Hierarchy.

SIAM J. Comput., 1996

On Closure Properties of #P in the Context of PF ° #P.

J. Comput. Syst. Sci., 1996

P-Selektive Sets and Reducing Search to Decision vs Self-Reducibility.

J. Comput. Syst. Sci., 1996

Relationships Among PL, #L, and the Determinant.

ITA, 1996

Functions Computable with Limited Access to NP.

Inf. Process. Lett., 1996

Computing Solutions Uniquely Collapses the Polynomial Hierarchy

Electronic Colloquium on Computational Complexity (ECCC), 1996

The complexity of matrix rank and feasible systems of linear equations

Electronic Colloquium on Computational Complexity (ECCC), 1996

Sparse Hard Sets for P Yields Space-Efficient Algorithms

Electronic Colloquium on Computational Complexity (ECCC), 1996

The PL Hierarchy Collapses

Electronic Colloquium on Computational Complexity (ECCC), 1996

Sparse Hard Sets for P Yield Space-Efficient Algorithms.

Chicago J. Theor. Comput. Sci., 1996

The PL Hierarchy Collapses.

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

The Complexity of Matrix Rank and Feasible Systems of Linear Equations (Extended Abstract).

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

Parallel Data Mining for Association Rules on Shared-Memory Multi-Processors.

Proceedings of the 1996 ACM/IEEE Conference on Supercomputing, 1996

1995

Equivalence of NC^k and AC^k-1 closures of NP and Other Classes

Inf. Comput., July, 1995

Polynomial-Time Membership Comparable Sets.

SIAM J. Comput., 1995

On Helping by Parity-Like Languages.

Inf. Process. Lett., 1995

Nondeterministically Selective Sets.

Int. J. Found. Comput. Sci., 1995

Communication Complexity of Key Agreement on Small Ranges.

STACS, 1995

Sparse P-Hard Sets Yield Space-Efficient Algorithms.

Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

Properties of Probabilistic Pushdown Automata (Extended Abstract).

Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

1994

Generalized Theorems on Relationships Among Reducibility Notions to Certain Complexity Classes.

Mathematical Systems Theory, 1994

On Serializable Languages.

Int. J. Found. Comput. Sci., 1994

Space-Efficient Recognition of Sparse Self-Reducible Languages.

Computational Complexity, 1994

NC^k(NP) = AC^(k-1)(NP).

Proceedings of the STACS 94, 1994

Computing Solutions Uniquely collapses the Polynomial Hierarchy.

Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

Polynomial-Time Membership Comparable Sets.

Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28, 1994

Relationships Among PL, #L, and the Determinant.

Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28, 1994

1993

Is #P Closed Under Subtraction?

Proceedings of the Current Trends in Theoretical Computer Science - Essays and Tutorials, 1993

On Sparse Hard Sets for Counting Classes.

Theor. Comput. Sci., 1993

A Relationship Between Difference Hierarchies and Relativized Polynomial Hierarchies.

Mathematical Systems Theory, 1993

A Complexity Theory for Feasible Closure Properties.

J. Comput. Syst. Sci., 1993

On Using Oracles That Compute Values.

Proceedings of the STACS 93, 1993

Selectivity.

Proceedings of the Computing and Information, 1993

On Closure Properties of #P in the Context of PF°#P.

Proceedings of the Eigth Annual Structure in Complexity Theory Conference, 1993

P-Selective Sets, and Reducing Search to Decision vs. Self-Reducability.

Proceedings of the Eigth Annual Structure in Complexity Theory Conference, 1993

1992

Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy.

SIAM J. Comput., 1992

Relating Equivalence and Reducibility to Sparse Sets.

SIAM J. Comput., 1992

Is #P Closed under Substraction?

Bulletin of the EATCS, 1992

Reductions to Sets of Low Information Content.

Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

Reductions to Sets of Low Information Content.

Proceedings of the Complexity Theory: Current Research, 1992

How Hard Are Sparse Sets?

Proceedings of the Seventh Annual Structure in Complexity Theory Conference, 1992

1991

On Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets.

SIAM J. Comput., 1991

Counting Classes Are at Least as Hard as the Polynomial-Time Hierarchy.

Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30, 1991

On One Query Self-Reducible Sets.

Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30, 1991

A Complexity Theory for Feasible Closure Properties.

Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30, 1991

Relating Equivalence and Reducibility to Sparse Sets.

1990

On Polynomial Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets

Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

On Polynominal Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets (Abstract).

Proceedings of the Proceedings: Fifth Annual Structure in Complexity Theory Conference, 1990