Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Kôiti Hasida

dblp:77/5882 · DBLP profile ↗
← Back
36ranked-venue papers
11as first author
1since 2021 · last 2024
0000-0002-0639-7745ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 27 · 11 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 10 · 3 first-authorDatabases, data management, data science and information retrieval · 6Software engineering, systems software and programming languages · 2Applied, interdisciplinary, general and emerging computing · 2Human-computer interaction and ubiquitous computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
3 papers
Web and social media mining · 42% Knowledge graphs · 27% Recommender systems · 24%
Artificial intelligence
3 papers
Speech recognition and synthesis · 35% Question answering and dialogue systems · 35% Information extraction and text analysis · 26%
Human-computer interaction and pervasive computing
1 paper
Collaborative and social computing · 100%

Topics — the 7 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Web and social media mining
social network extraction
0.122006
POLYPHONET: an advanced social network extraction system from the web · WWW 2006
Spinning Multiple Social Networks for Semantic Web · AAAI 2006
Recommender systems
user modeling
0.112007
Inferring Long-term User Properties Based on Users' Location History · IJCAI 2007
Knowledge graphs
semantic web
0.012006
Spinning Multiple Social Networks for Semantic Web · AAAI 2006
Natural language and speech › Question answering and dialogue systems
spoken dialogue systems
0.011993
Understanding Spoken Natural Language with Omni-Directional Information Flow · IJCAI 1993
Natural language and speech › Speech recognition and synthesis
spoken language understanding
0.011993
Understanding Spoken Natural Language with Omni-Directional Information Flow · IJCAI 1993
Collaborative and social computing
conversation analysis
0.011993
Joint Utterance: Intrasentential Speaker/Hearer Switch as an Emergent Phenomenon · IJCAI 1993
Natural language and speech › Language models and text generation › text generation
sentence generation
0.011987
Dependency Propagation: A Unified Theory of Sentence Comprehension and Generation · IJCAI 1987

Methods — techniques the papers use, named apart from their topics

web mining · 0.1search engine co-occurrence · 0.1relation classification · 0.1corpus analysis · 0.0dependency propagation · 0.0
YearPublicationVenuePosition
2024 Collaborative Graph-Document Composition is Efficient and Enhances Critical-Thinking Skills Without Extra Cost
Kôiti Hasida, Zilian Zhang, Zifan Yao, Vili Valtteri Karilas, Shitao Fang, Kuanghuan Tan, Kenichi Shibata, Yusuke Matsubara 0001
Diagrams1
2016 Graphical Annotation for Syntax-Semantics Mapping
Kôiti Hasida
LREC1
2014 K-repeating Substrings: a String-Algorithmic Approach to Privacy-Preserving Publishing of Textual Data
Yusuke Matsubara 0001, Kôiti Hasida
PACLIC2
2012 ISO 24617-2: A semantically-based standard for dialogue annotation
Harry Bunt, Jan Alexandersson, Jae-Woong Choe, Alex Chengyu Fang, Kôiti Hasida, Volha Petukhova, Andrei Popescu-Belis, David R. Traum
LREC5
2011 Acquisition of Service Practical Knowledge based on Ontologized Medical Workflow
Taisuke Ogawa, Mitsuru Ikeda, Muneou Suzuki, Kenji Araki, Kôiti Hasida
KEOD5
2011 Rotation invariant feature extraction from 3-D acceleration signals
abstract
In this paper, we propose a method to extract features from three-dimensional acceleration signals. The proposed method is based on the (auto-)correlation matrix of Fourier transform features, naturally containing the correlations between the frequencies as well as the ordinary power spectrum for each frequency. The proposed features are inherently invariant to both rotational variations and temporal shift (delay), whereas the other methods employ ad hoc preprocessing to increase robustness to those variations. Thereby, we can favorably apply the proposed method to analyze 3-D acceleration signals regardless of the orientations of the accelerometer. In the experiment on gait identification using an accelerometer embedded in a cellular phone, the proposed method outperformed the other methods.
Takumi Kobayashi 0001, Kôiti Hasida, Nobuyuki Otsu
ICASSP2
2010 Syntax and Semantics of Workflows That Include Passbacks
abstract
The questions of how to represent passbacks (redoing) of work in a workflow and of what semantics to apply to passbacks comprise an important issue in workflow research. In this paper, cyclic workflows are regarded as workflows with passbacks, and the normal form of a workflow is defined from properties of workflows as graphs. For a normal workflow, semantics based on passbacks is defined as a transition system on subgraphs of the workflow. Based on the transition system, this paper defines total correctness of a workflow with passbacks. Furthermore, this paper proves that total correctness of workflows with passbacks, defined in this paper, is a natural extension of the conventional correctness of acyclic workflows. This paper also shows that the correctness of a normal workflow amounts to the correctness of the acyclic sub-workflows included in the normal workflow.
Osamu Takaki, Izumi Takeuti, Noriaki Izumi, Kôiti Hasida
ICSEA4
2010 Towards an ISO Standard for Dialogue Act Annotation
Harry Bunt, Jan Alexandersson, Jean Carletta, Jae-Woong Choe, Alex Chengyu Fang, Kôiti Hasida, Kiyong Lee, Volha Petukhova, Andrei Popescu-Belis, Laurent Romary, Claudia Soria, David R. Traum
LREC6
2009 Service System Development Based on Web Process Ontology
abstract
This paper describes a methodology that providers of services can use to adapt their software applications, both intra-net and inter-net systems, to the changes of their business environment. The methodology enables agile software development based on a Web process architecture that executes ontology-based business processes as workflow systems. Ontology construction technology is used to extract business model of tasks and processes from business documents, model them, and organize them. Reflective semantics interoperates between RDF/XML representation of business tasks and Java objects of business process primitives. The gap between business models and service system applications is bridged by a Java-based software framework that executes business process as a set of Web page transitions. As a result, a business model is implemented as a thin client application. The software framework enables rapid spiral development of short-term cycles because business modelers, software developers, and users are able to share the same framework of description and systems. The feasibility of the methodology described here has been demonstrated in projects developing local-government workflow systems.
Noriaki Izumi, Osamu Takaki, Kôiti Hasida
ICSEA3
2008 Analytics and Management of Collaborative Intranets
Peter Géczy, Noriaki Izumi, Shotaro Akaho, Kôiti Hasida
CollaborateCom4
2008 A Method of Graphics Composition Using Differential SVG Documents
Motohiro Matsuda, Kazunari Ito, Martin J. Dürst, Kôiti Hasida
KES (2)4
2007 Navigation Space Based Intranet Usability Analysis
abstract
Usability is a vital quality factor of electronic environments. Increasing complexity of Web based platforms and mining large data volumes constantly rise demands on effective usability analysis tools. The article presents a novel formalism allowing examination of usability characteristics with the spectrum of metrics. The approach was applied to the usability analysis of a large corporate intranet. Majority of the users were knowledge workers. Important usability features have been revealed. The knowledge workers efficiently utilized only a minor portion of available intranet resources and exhibited strong pattern formation tendency. The frequently repeating browsing patterns were generally easily executable
Peter Géczy, Noriaki Izumi, Shotaro Akaho, Kôiti Hasida
CIDM4
2007 Inferring Long-term User Properties Based on Users' Location History
Yutaka Matsuo, Naoaki Okazaki, Kiyoshi Izumi, Yoshiyuki Nakamura, Takuichi Nishimura, Kôiti Hasida, Hideyuki Nakashima
IJCAI6
2007 POLYPHONET: An advanced social network extraction system from the Web
Yutaka Matsuo, Junichiro Mori, Masahiro Hamasaki, Takuichi Nishimura, Hideaki Takeda 0001, Kôiti Hasida, Mitsuru Ishizuka
J. Web Semant.6
2006 Spinning Multiple Social Networks for Semantic Web
Yutaka Matsuo, Masahiro Hamasaki, Yoshiyuki Nakamura, Takuichi Nishimura, Kôiti Hasida, Hideaki Takeda 0001, Junichiro Mori, Danushka Bollegala, Mitsuru Ishizuka
AAAI5
2006 Navigation Space Formalism and Exploration of Knowledge Worker Behavior on Intranet
Peter Géczy, Noriaki Izumi, Shotaro Akaho, Kôiti Hasida
iiWAS4
2006 POLYPHONET: an advanced social network extraction system from the web
abstract
Social networks play important roles in the Semantic Web: knowledge management, information retrieval, ubiquitous computing, and so on. We propose a social network extraction system called POLYPHONET, which employs several advanced techniques to extract relations of persons, detect groups of persons, and obtain keywords for a person. Search engines, especially Google, are used to measure co-occurrence of information and obtain Web documents.Several studies have used search engines to extract social networks from the Web, but our research advances the following points: First, we reduce the related methods into simple pseudocodes using Google so that we can build up integrated systems. Second, we develop several new algorithms for social networking mining such as those to classify relations into categories, to make extraction scalable, and to obtain and utilize person-to-word relations. Third, every module is implemented in POLYPHONET, which has been used at four academic conferences, each with more than 500 participants. We overview that system. Finally, a novel architecture called Super Social Network Mining is proposed; it utilizes simple modules using Google and is characterized by scalability and Relate-Identify processes: Identification of each entity and extraction of relations are repeated to obtain a more precise social network.
Yutaka Matsuo, Junichiro Mori, Masahiro Hamasaki, Keisuke Ishida, Takuichi Nishimura, Hideaki Takeda 0001, Kôiti Hasida, Mitsuru Ishizuka
WWW7
2004 Finding Social Network for Trust Calculation
Yutaka Matsuo, Hironori Tomobe, Kôiti Hasida, Mitsuru Ishizuka
ECAI3
2004 Spatial Function Representation and Retrieval
Yutaka Matsuo, Akira Takagi, Shigeyoshi Hiratsuka, Kôiti Hasida, Hideyuki Nakashima
PRICAI4
2003 Mining Social Network of Conference Participants from the Web
abstract
In a ubiquitous computing environment, it is desirable to provide a user with information depending on a user's situation, such as time, location, user behavior, and social context. At conventions, such as academic conferences and exhibitions, where participants must register in advance, the social context of participants can be extracted from the Web using their names and affiliations without asking the participants many questions. Here, we attempt to extract the social network of participants from the Web, where a node represents a participant and an edge represents the relationship of two participants. Each edge is added using the number of pages retrieved by a search engine which include both participants names. Moreover, each edge has a label such as "coauthors" and "members of the same project" by applying classification rules to the page content. We show an example of the extracted network and make a preliminary evaluation. This network can be used in many information services, such as finding an appropriate introducer or negotiator, and who one should talk to in order to efficiently expand his/her network.
Yutaka Matsuo, Hironori Tomobe, Kôiti Hasida, Mitsuru Ishizuka
Web Intelligence3
2002 Semantics of multimedia in MPEG-7
abstract
In this paper, we present the tools standardized by MPEG-7 for describing the semantics of multimedia. In particular, we focus on the abstraction model, entities, attributes and relations of MPEG-7 semantic descriptions. MPEG-7 tools can describe the semantics of specific instances of multimedia such as one image or one video segment but can also generalize these descriptions either to multiple instances of multimedia or to a set of semantic descriptions. The key components of MPEG-7 semantic descriptions are semantic entities such as objects and events, attributes of these entities such as labels and properties, and, finally, relations of these entities such as an object being the patient of an event. The descriptive power and usability of these tools has been demonstrated in numerous experiments and applications, these make them key candidates to enable intelligent applications that deal with multimedia at human levels.
Ana B. Benitez, Hawley K. Rising, Corinne Jörgensen, Riccardo Leonardi, Alessandro Bugatti, Kôiti Hasida, Rajiv Mehrotra, A. Murat Tekalp, Ahmet Ekin, Toby Walker
ICIP (1)6
2002 Construction of a Japanese Relevance-tagged Corpus
Daisuke Kawahara, Sadao Kurohashi, Kôiti Hasida
LREC3
2000 Multi-Topic Multi-Document Summarization
Masao Utiyama, Kôiti Hasida
COLING2
1998 The RWC text databases
Kôiti Hasida, Hitoshi Isahara, Takenobu Tokunaga, Minako Hashimoto, Shiho Ogino, Wakako Kashino, Jun Toyoura, Hironobu Takahashi
LREC1
1998 Automatic Soccer Commentary and RoboCup
Hitoshi Matsubara, Itsuki Noda, Ian Frank, Hideyuki Nakashima, Kumiko Tanaka-Ishii, Kôiti Hasida
RoboCup6
1996 Issues in Communication Game
Kôiti Hasida
COLING1
1994 Emergent Parsing and Generation with Generalized Chart
Kôiti Hasida
COLING1
1994 Probabilistic constraint for integrated speech and language processing
Katashi Nagao, Kôiti Hasida, Takashi Miyata
ICSLP2
1993 Joint Utterance: Intrasentential Speaker/Hearer Switch as an Emergent Phenomenon
Kôiti Hasida, Katashi Nagao, Takashi Miyata
IJCAI1
1993 Understanding Spoken Natural Language with Omni-Directional Information Flow
Katashi Nagao, Kôiti Hasida, Takashi Miyata
IJCAI2
1990 A Constraint-Based Approach to Linguistic Performance
Kôiti Hasida
COLING1
1990 Sentence Processing as Constraint Transformation
Kôiti Hasida
ECAI1
1989 JPSG Parser on Constraint Logic Programming
Hirosi Tuda, Kôiti Hasida, Hidetosi Sirai
EACL2
1988 A Cognitive account of unbounded dependency
Kôiti Hasida
COLING1
1987 Dependency Propagation: A Unified Theory of Sentence Comprehension and Generation
Kôiti Hasida, Syun Isizaki
IJCAI1
1986 Conditioned Unification for Natural Language Processing
Kôiti Hasida
COLING1