Organizational justice and management trustworthiness during organizational Change: Interactions of Benevolence,Integrity, and managerial approaches     

Yu Cui  Hao Jiao 《Information processing & management》2019,56(4):1526-1542

Trust and justice play an important role in the process of organizational change to build dynamic capabilities for sustainable competitive advantage. This study investigated the interaction effects of management's benevolence trustworthiness and integrity trustworthiness on employees’ perception of procedural justice during innovation or organizational change. Both the scenario and the field study showed that the patterns of the interaction effects of these two components of trustworthiness are further influenced in a complementary manner by different innovation approaches. The study indicated that the relationships between benevolence trustworthiness and integrity trustworthiness are far more complex than expected and thus need more research efforts.  相似文献   

Advanced Arabic Natural Language Processing (ANLP) and its applications: Introduction to the special issue     

Yaser Jararweh  Mahmoud Al-Ayyoub  Elhadj Benkhelifa 《Information processing & management》2019,56(2):259-261

  相似文献   

Writer identification approach based on bag of words with OBI features     

Amal Durou  Ibrahim Aref  Somaya Al-Maadeed  Ahmed Bouridane  Elhadj Benkhelifa 《Information processing & management》2019,56(2):354-366

Handwriter identification aims to simplify the task of forensic experts by providing them with semi-automated tools in order to enable them to narrow down the search to determine the final identification of an unknown handwritten sample. An identification algorithm aims to produce a list of predicted writers of the unknown handwritten sample ranked in terms of confidence measure metrics for use by the forensic expert will make the final decision.Most existing handwriter identification systems use either statistical or model-based approaches. To further improve the performances this paper proposes to deploy a combination of both approaches using Oriented Basic Image features and the concept of graphemes codebook. To reduce the resulting high dimensionality of the feature vector a Kernel Principal Component Analysis has been used. To gauge the effectiveness of the proposed method a performance analysis, using IAM dataset for English handwriting and ICFHR 2012 dataset for Arabic handwriting, has been carried out. The results obtained achieved an accuracy of 96% thus demonstrating its superiority when compared against similar techniques.  相似文献   

Online visibility of software-related web sites: The case of biomedical text mining tools     

Gael Pérez-Rodríguez  Martín Pérez-Pérez  Florentino Fdez-Riverola  Anália Lourenço 《Information processing & management》2019,56(3):565-583

  相似文献   

Web document summarization by exploiting social context with matrix co-factorization     

Minh-Tien Nguyen  Viet Cuong Tran  Xuan Hoai Nguyen  Le-Minh Nguyen 《Information processing & management》2019,56(3):495-515

In the context of social media, users usually post relevant information corresponding to the contents of events mentioned in a Web document. This information posses two important values in that (i) it reflects the content of an event and (ii) it shares hidden topics with sentences in the main document. In this paper, we present a novel model to capture the nature of relationships between document sentences and post information (comments or tweets) in sharing hidden topics for summarization of Web documents by utilizing relevant post information. Unlike previous methods which are usually based on hand-crafted features, our approach ranks document sentences and user posts based on their importance to the topics. The sentence-user-post relation is formulated in a share topic matrix, which presents their mutual reinforcement support. Our proposed matrix co-factorization algorithm computes the score of each document sentence and user post and extracts the top ranked document sentences and comments (or tweets) as a summary. We apply the model to the task of summarization on three datasets in two languages, English and Vietnamese, of social context summarization and also on DUC 2004 (a standard corpus of the traditional summarization task). According to the experimental results, our model significantly outperforms the basic matrix factorization and achieves competitive ROUGE-scores with state-of-the-art methods.  相似文献   

Neural embedding-based indices for semantic search     

Fatemeh Lashkari  Ebrahim Bagheri  Ali A. Ghorbani 《Information processing & management》2019,56(3):733-755

Traditional information retrieval techniques that primarily rely on keyword-based linking of the query and document spaces face challenges such as the vocabulary mismatch problem where relevant documents to a given query might not be retrieved simply due to the use of different terminology for describing the same concepts. As such, semantic search techniques aim to address such limitations of keyword-based retrieval models by incorporating semantic information from standard knowledge bases such as Freebase and DBpedia. The literature has already shown that while the sole consideration of semantic information might not lead to improved retrieval performance over keyword-based search, their consideration enables the retrieval of a set of relevant documents that cannot be retrieved by keyword-based methods. As such, building indices that store and provide access to semantic information during the retrieval process is important. While the process for building and querying keyword-based indices is quite well understood, the incorporation of semantic information within search indices is still an open challenge. Existing work have proposed to build one unified index encompassing both textual and semantic information or to build separate yet integrated indices for each information type but they face limitations such as increased query process time. In this paper, we propose to use neural embeddings-based representations of term, semantic entity, semantic type and documents within the same embedding space to facilitate the development of a unified search index that would consist of these four information types. We perform experiments on standard and widely used document collections including Clueweb09-B and Robust04 to evaluate our proposed indexing strategy from both effectiveness and efficiency perspectives. Based on our experiments, we find that when neural embeddings are used to build inverted indices; hence relaxing the requirement to explicitly observe the posting list key in the indexed document: (a) retrieval efficiency will increase compared to a standard inverted index, hence reduces the index size and query processing time, and (b) while retrieval efficiency, which is the main objective of an efficient indexing mechanism improves using our proposed method, retrieval effectiveness also retains competitive performance compared to the baseline in terms of retrieving a reasonable number of relevant documents from the indexed corpus.  相似文献   

Cognitive-inspired domain adaptation of sentiment lexicons     

Frank Z. Xing  Filippo Pallucchini  Erik Cambria 《Information processing & management》2019,56(3):554-564

Sentiment lexicons are essential tools for polarity classification and opinion mining. In contrast to machine learning methods that only leverage text features or raw text for sentiment analysis, methods that use sentiment lexicons embrace higher interpretability. Although a number of domain-specific sentiment lexicons are made available, it is impractical to build an ex ante lexicon that fully reflects the characteristics of the language usage in endless domains. In this article, we propose a novel approach to simultaneously train a vanilla sentiment classifier and adapt word polarities to the target domain. Specifically, we sequentially track the wrongly predicted sentences and use them as the supervision instead of addressing the gold standard as a whole to emulate the life-long cognitive process of lexicon learning. An exploration-exploitation mechanism is designed to trade off between searching for new sentiment words and updating the polarity score of one word. Experimental results on several popular datasets show that our approach significantly improves the sentiment classification performance for a variety of domains by means of improving the quality of sentiment lexicons. Case-studies also illustrate how polarity scores of the same words are discovered for different domains.  相似文献   

In (Big) Data we trust: Value creation in knowledge organizations - Introduction to the special issue     

Andrea De Mauro  Marco Greco  Michele Grimaldi  Paavo Ritala 《Information processing & management》2018,54(5):755-757

  相似文献   

Stability analysis and control design based on average dwell time approaches for switched nonlinear port-controlled Hamiltonian systems     

Zi-Ming Wang  Airong Wei  Xianfu Zhang 《Journal of The Franklin Institute》2019,356(6):3368-3397

  相似文献   

Aperiodic sampled-data robust H∞ control for delayed stochastic fuzzy systems with quasi-periodical multi-rate approach     

Shuqi Li  Feiqi Deng  Mali Xing 《Journal of The Franklin Institute》2019,356(8):4530-4553

  相似文献