![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Isamu Shioya
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2014
- [j5]Isamu Shioya:
An Accelerated Resource Utilization in Autonomous Stochastic Mobile Multi-Agents. Int. J. Innov. Digit. Econ. 5(1): 1-14 (2014) - 2007
- [j4]Isamu Shioya, Hirohito Oh'uchi, Takao Miura:
Document Retrieval by Projection Based Frequency Distribution. Int. J. Artif. Intell. Tools 16(4): 647-659 (2007) - 2005
- [j3]Hiroshi Uejima, Takao Miura, Isamu Shioya:
Improving text categorization by resolving semantic ambiguity. Syst. Comput. Jpn. 36(4): 1-8 (2005) - 2004
- [j2]Takao Miura, Isamu Shioya, Hiroshi Uejima:
Estimating timestamp from incomplete news corpus. Commun. Inf. Syst. 4(4): 273-288 (2004) - 1991
- [j1]Isamu Shioya, Katsuhiko Nakamura:
Logic hypergraph grammars and context-free hypergraph grammars. Syst. Comput. Jpn. 22(7): 1-11 (1991)
Conference and Workshop Papers
- 2023
- [c48]Maino Ariga, Isamu Shioya:
Explosive Propagation of a Modified Axelrod Cultural Dissemination with Time Delays. FICC (1) 2023: 120-135 - 2012
- [c47]Isamu Shioya, Takao Miura:
An accelerated learning algorithm of Gaussian mixture processes. DICTAP 2012: 486-491 - 2010
- [c46]Takashi Yanagisawa, Takao Miura, Isamu Shioya:
Sentences Generation by Frequent Parsing Patterns. IDEAL 2010: 53-62 - [c45]Kazuho Igoshi, Takao Miura, Isamu Shioya:
Multi-agent System Environment Based on Repeated Local Effect Functions. NDT (2) 2010: 342-355 - [c44]Akifumi Katsumata, Takao Miura, Isamu Shioya:
Approximate String Matching Using Markovian Distance. PAAP 2010: 231-238 - 2008
- [c43]Masataka Izumi, Takao Miura, Isamu Shioya:
Entropy-Based Age Estimation of Blog Authors. COMPSAC 2008: 795-800 - 2007
- [c42]Kou Takahashi, Takao Miura, Isamu Shioya:
Hierarchical Summarizing and Evaluating for Web Pages. EROW 2007 - [c41]Yukiteru Yoshihara, Takao Miura, Isamu Shioya:
Classifying Polyphonic Melodies by Chord Estimation Based on Hidden Markov Model. IDEAL 2007: 589-598 - [c40]Kazuhiro Shimizu, Isamu Shioya, Takao Miura:
Mining Disjunctive Sequential Patterns from News Stream. IDEAL 2007: 630-642 - 2006
- [c39]Kyosuke Yasuda, Takao Miura, Isamu Shioya:
Distributed Processes on Tree Hash. COMPSAC (2) 2006: 10-13 - [c38]Masaki Mori, Takao Miura, Isamu Shioya:
Topic Detection and Tracking for News Web Pages. Web Intelligence 2006: 338-342 - 2005
- [c37]Ryosuke Miyoshi, Takao Miura, Isamu Shioya:
Nearest Neighbor Queries on Extensible Grid Files Using Dimensionality Reduction. COMPSAC (1) 2005: 249-255 - [c36]Kou Takahashi, Takao Miura, Isamu Shioya:
Clustering Web Documents Based on Correlation of Hyperlinks. ICDE Workshops 2005: 1225 - [c35]Hirohito Oh'uchi, Takao Miura, Isamu Shioya:
Querying on News Stream by Using Random Projection. ICITA (1) 2005: 185-190 - [c34]Hirohito Oh'uchi, Takao Miura, Isamu Shioya:
Document Retrieval Using Projection by Frequency Distribution. ICTAI 2005: 356-361 - 2004
- [c33]Masahiro Motoyoshi, Takao Miura, Isamu Shioya:
Clustering Stream Data by Regression Analysis. ACSW 2004: 115-120 - [c32]Hiroyuki Nakanishi, Takao Miura, Isamu Shioya:
Reasoning in Collaboration Diagrams by Description Logics. CATA 2004: 127-130 - [c31]Hiroshi Uejima, Takao Miura, Isamu Shioya:
Giving Temporal Order to News Corpus. CIS 2004: 947-953 - [c30]Kohei Mitsuhashi, Takao Miura, Isamu Shioya:
Looking Up Files in Peer-to-Peer Using Hierarchical Bloom Filters. CIS 2004: 982-988 - [c29]Hiroshi Uejima, Takao Miura, Isamu Shioya:
Giving Temporal Order to News Corpus. ICTAI 2004: 208-215 - [c28]Tomoya Takamitsu, Takao Miura, Isamu Shioya:
Pre-pruning Decision Trees by Local Association Rules. IDEAL 2004: 148-151 - [c27]Hirohito Oh'uchi, Takao Miura, Isamu Shioya:
Retrieval for Text Streams by Random Projection. ISTA 2004: 151-164 - [c26]Ryosuke Miyoshi, Takao Miura, Isamu Shioya:
Querying Spatial Data on Extensible Grid Files. Multimedia Information Systems 2004: 86- - 2003
- [c25]Takao Miura, Isamu Shioya:
Similarity among melodies for music information retrieval. CIKM 2003: 61-68 - [c24]Masataro Shiroiwa, Takao Miura, Isamu Shioya:
Meta Model Approach for Mediation. COMPSAC 2003: 480-485 - [c23]Masahiro Motoyoshi, Takao Miura, Isamu Shioya:
Clustering by Regression Analysis. DaWaK 2003: 202-211 - [c22]Tomoya Takamitsu, Takao Miura, Isamu Shioya:
Decision Trees Using Class Hierarchy. HIS 2003: 722-731 - 2002
- [c21]Shingo Kashikawa, Shogo Ogura, Isamu Shioya, Takao Miura:
Aggregates as Meta Functions. ISMIS 2002: 203-212 - 2001
- [c20]Takao Miura, Isamu Shioya:
Assessment by belief. ADC 2001: 131-137 - [c19]Wataru Matsumoto, Shingo Kashikawa, Takao Miura, Isamu Shioya:
Logical optimization for meta queries. CATA 2001: 433-436 - [c18]Kohei Watanabe, Takao Miura, Isamu Shioya:
Discovery of Temporal Knowledge from Databases. IRI 2001: 13-17 - 2000
- [c17]Takao Miura, Wataru Matsumoto, Isamu Shioya, Yukio Wada:
Extensible Perfect Hashing. CIKM 2000: 446-452 - [c16]Takao Miura, Isamu Shioya, Mikihiro Mori:
Making Decision Trees More Accurate by Losing Information. FoIKS 2000: 213-225 - [c15]Isamu Shioya, Takao Miura:
Knowledge pruning in decision trees. ICTAI 2000: 40- - [c14]Isamu Shioya, Takao Miura:
Inductive Classification Using Taxonomy. KRDB 2000: 87-98 - [c13]Takao Miura, Isamu Shioya, Kohei Watanabe:
Behavior Discovery as Database Scheme Design. TIME 2000: 115-122 - [c12]Takao Miura, Wataru Matsumoto, Shingo Kashikawa, Isamu Shioya:
Signature Coding for Meta Objects. WISE (2) 2000: 89-96 - 1999
- [c11]Takao Miura, Isamu Shioya:
A Design Methodology for Data Warehousing Based on Machine Learning. Applied Informatics 1999: 668-672 - [c10]Takao Miura, Wataru Matsumoto, Isamu Shioya:
Managing Meta Objects for Design of Warehouse Data. DaWaK 1999: 33-40 - [c9]Takao Miura, Isamu Shioya:
Incremental Update of Decision Trees for Temporal Objects. KRDB 1999: 41-45 - 1998
- [c8]Takao Miura, Isamu Shioya:
Learning Concepts From Databases. DEXA 1998: 826-840 - [c7]Isamu Shioya, Takao Miura:
Object clustering for scheme learning. ICTAI 1998: 2-9 - 1997
- [c6]Takao Miura, Isamu Shioya:
Examining Complex Objects for Type Scheme Discovery. DEXA 1997: 462-477 - [c5]Isamu Shioya, Takao Miura:
Knowledge Discovery in Scheme Approximation. ICTAI 1997: 568-573 - 1996
- [c4]Takao Miura, Isamu Shioya:
Paradigm for Scheme Discovery. CODAS 1996: 285-292 - [c3]Takao Miura, Isamu Shioya:
Mining Type Schemes in Databases. DEXA 1996: 369-385 - [c2]Takao Miura, Isamu Shioya:
Knowledge Acquisition for Classification Systems. ICTAI 1996: 110-115 - 1995
- [c1]Takao Miura, Isamu Shioya:
Strategy Control for Database Queries. DEXA Workshop 1995: 231-240
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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).
Privacy notice: By enabling the option above, your browser will contact the API of 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.
last updated on 2024-04-25 05:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint